Search

This book constitutes the refereed proceedings of the 5th International Workshop on Algorithmic Bias in Search and Recommendation, BIAS 2024, held in Washington, DC, USA, on July 18, 2024 in hybrid mode. The 7 full papers included in this book were carefully reviewed and selected from 20 submissions. They are grouped into three thematic sessions, each focusing on distinct aspects of bias and fairness in information retrieval.

This is an open access book.Scope of Conference 2023 International Conference on Image, Algorithms and Artificial Intelligence (ICIAAI2023), which will be held from August 11 to August 13 in Singapore provides a forum for researchers and experts in different but related fields to discuss research findings. The scope of ICIAAI 2023 covers research areas such as imaging, algorithms and artificial intelligence. Related fields of research include computer software, programming languages, software engineering, computer science applications, artificial intelligence, Intelligent data analysis, deep learning, high-performance computing, signal processing, information systems, computer graphics, computer-aided design, Computer vision, etc.The objectives of the conference are:The conference aims to provide a platform for experts, scholars, engineers and technicians engaged in the research ofimage, algorithm and artificial intelligence to share scientific research results and cutting-edge technologies.The conference will discuss the academic trends and development trends of the related research fields of image, algorithm and artificial intelligence together, carry out discussions on current hot issues, and broaden research ideas. It will be a perfect gathering to strengthen academic research and discussion, promote the development and progress of relevant research and application, and promote the development of disciplines and promote talent training.

The two-volume set LNAI 14125 and 14126 constitutes the refereed conference proceedings of the 22nd International Conference on Artificial Intelligence and Soft Computing, ICAISC 2023, held in Zakopane, Poland, during June 18–22, 2023. The 84 revised full papers presented in these proceedings were carefully reviewed and selected from 175 submissions. The papers are organized in the following topical sections: Part I: Neural Networks and Their Applications; Evolutionary Algorithms and Their Applications; and Artificial Intelligence in Modeling and Simulation. Part II: Computer Vision, Image and Speech Analysis; Various Problems of Artificial Intelligence; Bioinformatics, Biometrics and Medical Applications; and Data Mining and Pateern Classification.

The two-volume set LNAI 14125 and 14126 constitutes the refereed conference proceedings of the 22nd International Conference on Artificial Intelligence and Soft Computing, ICAISC 2023, held in Zakopane, Poland, during June 18–22, 2023.The 84 revised full papers presented in these proceedings were carefully reviewed and selected from 175 submissions.The papers are organized in the following topical sections:Part I: Neural Networks and Their Applications; Evolutionary Algorithms and Their Applications; and Artificial Intelligence in Modeling and Simulation.Part II: Computer Vision, Image and Speech Analysis; Various Problems of Artificial Intelligence; Bioinformatics, Biometrics and Medical Applications; and Data Mining and Pateern Classification.

This book constitutes the refereed proceedings of the 13th International Conference on Algorithms and Complexity, CIAC 2023, which took place in Larnaca, Cyprus, during June 13–16, 2023. The 25 full papers included in this book were carefully reviewed and selected from 49 submissions. They cover all important areas of research on algorithms and complexity such as algorithm design and analysis; sequential, parallel and distributed algorithms; data structures; computational and structural complexity; lower bounds and limitations of algorithms; randomized and approximation algorithms; parameterized algorithms and parameterized complexity classes; smoothed analysis of algorithms; alternatives to the worst-case analysis of algorithms (e.g., algorithms with predictions), on-line computation and competitive analysis, streaming algorithms, quantum algorithms and complexity, algorithms in algebra, geometry, number theory and combinatorics, computational geometry, algorithmic game theory and mechanism design, algorithmic economics (including auctions and contests), computational learning theory, computational biology and bioinformatics, algorithmic issues in communication networks, algorithms for discrete optimization (including convex optimization) and algorithm engineering.

This book constitutes refereed proceedings of the Third International Workshop on Algorithmic Bias in Search and Recommendation, BIAS 2022, held in April, 2022. The 9 full papers and 4 short papers were carefully reviewed and selected from 34 submissions. The papers cover topics that go from search and recommendation in online dating, education, and social media, over the impact of gender bias in word embeddings, to tools that allow to explore bias and fairnesson the Web.

This book constitutes the refereed proceedings of the 14th International Symposium on Algorithmic Game Theory, SAGT 2021, held in Aarhus, Denmark in September 2021.The 26 full papers presented together with 4 abstract papers were carefully reviewed and selected from 73 submissions. In addition, the volume contains abstracts from 3 invited talks and 2 tutorial talks. The papers are organized in topical sections named: auctions and mechanism design, computational aspects of games, markets and matchings, and social choice and cooperative games.

ACMES (Algorithms and Complexity in Mathematics, Epistemology, and Science) is a multidisciplinary conference series that focuses on epistemological and mathematical issues relating to computation in modern science. This volume includes a selection of papers presented at the 2015 and 2016 conferences held at Western University that provide an interdisciplinary outlook on modern applied mathematics that draws from theory and practice, and situates it in proper context. These papers come from leading mathematicians, computational scientists, and philosophers of science, and cover a broad collection of mathematical and philosophical topics, including numerical analysis and its underlying philosophy, computer algebra, reliability and uncertainty quantification, computation and complexity theory, combinatorics, error analysis, perturbation theory, experimental mathematics, scientific epistemology, and foundations of mathematics. By bringing together contributions from researchers who approach the mathematical sciences from different perspectives, the volume will further readers'understanding of the multifaceted role of mathematics in modern science, informed by the state of the art in mathematics, scientific computing, and current modeling techniques.

This volume contains the proceedings of RTA-93, the fifth International Conference on Rewriting Techniques and Applications, held in Montreal, Canada, in June 1993. The volume includes three invited lectures,'Rewrite techniques in theorem proving'(L. Bachmair),'Proving properties of typed lambda terms: realizability, covers, and sheaves'(J. Gallier), and'On some algorithmic problems for groups and monoids'(S.J. Adian), together with 29 selected papers, 6 system descriptions, and a list of open problems in the field. The papers covermany topics: term rewriting; termination; graph rewriting; constraint solving; semantic unification, disunification and combination; higher-order logics; and theorem proving, with several papers on distributed theorem proving, theorem proving with constraints and completion.

Shortest path problems are among the most fundamental combinatorial optimization problems with many applications, both direct and as subroutines. They arise naturally in a remarkable number of real-world settings. A limited list includes transportation planning, network optimization, packet routing, image segmentation, speech recognition, document formatting, robotics, compilers, traffic information systems, and dataflow analysis. Shortest path algorithms have been studied since the 1950's and still remain an active area of research. This volume reports on the research carried out by participants during the Ninth DIMACS Implementation Challenge, which led to several improvements of the state of the art in shortest path algorithms. The infrastructure developed during the Challenge facilitated further research in the area, leading to substantial follow-up work as well as to better and more uniform experimental standards. The results of the Challenge included new cutting-edge techniques for emerging applications such as GPS navigation systems, providing experimental evidence of the most effective algorithms in several real-world settings.

Control Engineering and Information Systems contains the papers presented at the 2014 International Conference on Control Engineering and Information Systems (ICCEIS 2014, Yueyang, Hunan, China, 20-22 June 2014). All major aspects of the theory and applications of control engineering and information systems are addressed, including: � Intelligent s

This volume contains the proceedings of the AMS Special Session on Algorithmic Problems of Group Theory and Their Complexity, held January 9–10, 2013 in San Diego, CA and the AMS Special Session on Algorithmic Problems of Group Theory and Applications to Information Security, held April 6–7, 2013 at Boston College, Chestnut Hill, MA. Over the past few years the field of group-based cryptography has attracted attention from both group theorists and cryptographers. The new techniques inspired by algorithmic problems in non-commutative group theory and their complexity have offered promising ideas for developing new cryptographic protocols. The papers in this volume cover algorithmic group theory and applications to cryptography.

In den letzten Jahren hat sich der Workshop'Bildverarbeitung für die Medizin'durch erfolgreiche Veranstaltungen etabliert. Ziel ist auch 2013 wieder die Darstellung aktueller Forschungsergebnisse und die Vertiefung der Gespräche zwischen Wissenschaftlern, Industrie und Anwendern. Die Beiträge dieses Bandes - einige davon in englischer Sprache - umfassen alle Bereiche der medizinischen Bildverarbeitung, insbesondere Algorithmen, Hard- und Softwaresysteme soei deren klinische Anwendung, u.a.: Bildgebung und -akquisition, Sichtbares Licht, Endoskopie, Mikroskopie, Visualisierung und Animation, Patientenindividuelle Simulaltion und Planung, Computerunterstützte Diagnose, Biomechanische Modellierung, Computergestützte Operationsplanung, Bildverarbeitung in der Telemedizin, Bildgestützte Roboter und Chirurgische Simulatoren.

The 1990s are proving to be a very exciting p&iod for high angular resolution astronomy. At radio wavelengths a combination of new array instruments and pow­ erful imaging algorithms have generated images of unprecedented resolution and quality. In the optical and infrared, the great technical difficulties associated with constructing separated-aperture interferometers have been largely overcome, and many new instruments are now operating or are being developed. As these pro­ grams start to produce observational results they will be able to draw extensively on the experience gained by the radio-interferometry community. Thus it seemed that the time was ripe for a meeting which would bring together workers from all wavelength ranges to discuss the details of the science and art of'Very High Angular Resolution Imaging'. While the main emphasis of Symposium No. 158 was on high resolution tech­ niques from the radio, mm-wave, infrared and optical bands, it also provided an opportunity for presentation of astronomical results from these techniques. As well as giving our colleagues from the Northern Hemisphere a break from midwinter, the location of the Symposium in Australia recognised the continuing development of astronomical interferometry in this country, especially the recent completion of the Australia Telescope radio array, and the progress toward com­ missioning of the Sydney University Stellar Interferometer. A number of the par­ ticipants visited these instruments during the post-symposium tour.

This book constitutes the thoroughly refereed post-workshop proceedings of the 24th International Workshop on Combinatorial Algorithms, IWOCA 2013, held in Rouen, France, in July 2013. The 33 revised full papers presented together with 10 short papers and 5 invited talks were carefully reviewed and selected from a total of 91 submissions. The papers are organized in topical sections on algorithms on graphs; algorithms on strings; discrete geometry and satisfiability.

The articles collected in this volume represent the contributions presented at the IMA workshop on'Dynamics of Algorithms'which took place in November 1997. The workshop was an integral part of the 1997 -98 IMA program on'Emerging Applications of Dynamical Systems.'The interaction between algorithms and dynamical systems is mutually beneficial since dynamical methods can be used to study algorithms that are applied repeatedly. Convergence, asymptotic rates are indeed dynamical properties. On the other hand, the study of dynamical systems benefits enormously from having efficient algorithms to compute dynamical objects.

This book constitutes the refereed proceedings of the International Workshop on Augemented Environments for Computer-Assited Interventions, held in conjunction with MICCAI 2011, in Toronto, Canada, in September 2011. The 13 revised full papers presented were carefully reviewed and selected from 21 submissions. The papers cover the following topics: image registration and fusion, calibration, visualisation and 3D perception, hardware and optical design, real-time implementations, validation, clinical applications and clinical evaluation.

The NATO Advanced Study Institute on'Algorithms for continuous optimiza­ tion: the state of the art'was held September 5-18, 1993, at II Ciocco, Barga, Italy. It was attended by 75 students (among them many well known specialists in optimiza­ tion) from the following countries: Belgium, Brasil, Canada, China, Czech Republic, France, Germany, Greece, Hungary, Italy, Poland, Portugal, Rumania, Spain, Turkey, UK, USA, Venezuela. The lectures were given by 17 well known specialists in the field, from Brasil, China, Germany, Italy, Portugal, Russia, Sweden, UK, USA. Solving continuous optimization problems is a fundamental task in computational mathematics for applications in areas of engineering, economics, chemistry, biology and so on. Most real problems are nonlinear and can be of quite large size. Devel­ oping efficient algorithms for continuous optimization has been an important field of research in the last 30 years, with much additional impetus provided in the last decade by the availability of very fast and parallel computers. Techniques, like the simplex method, that were already considered fully developed thirty years ago have been thoroughly revised and enormously improved. The aim of this ASI was to present the state of the art in this field. While not all important aspects could be covered in the fifty hours of lectures (for instance multiob­ jective optimization had to be skipped), we believe that most important topics were presented, many of them by scientists who greatly contributed to their development.

This volume contains the texts of the principal survey papers presented at ALGORITHMS -and ORDER, held· at Ottawa, Canada from June 1 to June 12, 1987. The conference was supported by grants from the N.A.T.O. Advanced Study Institute programme, the University of Ottawa, and the Natural Sciences and Engineering Research Council of Canada. We are grateful for this considerable support. Over fifty years ago, the Symposium on Lattice Theory, in Charlottesville, U.S.A., proclaimed the vitality of ordered sets. Only twenty years later the Symposium on Partially Ordered Sets and Lattice Theory, held at Monterey, U.S.A., had solved many of the problems that had been originally posed. In 1981, the Symposium on Ordered Sets held at Banff, Canada, continued this tradition. It was marked by a landmark volume containing twenty-three articles on almost all current topics in the theory of ordered sets and its applications. Three years after, Graphs and Orders, also held at Banff, Canada, aimed to document the role of graphs in the theory of ordered sets and its applications. Because of its special place in the landscape of the mathematical sciences order is especially sensitive to new trends and developments. Today, the most important current in the theory and application of order springs from theoretical computer seience. Two themes of computer science lead the way. The first is data structure. Order is common to data structures.

Discrete probability theory and the theory of algorithms have become close partners over the last ten years, though the roots of this partnership go back much longer. The papers in this volume address the latest developments in this active field. They are from the IMA Workshops'Probability and Algorithms'and'The Finite Markov Chain Renaissance.'They represent the current thinking of many of the world's leading experts in the field. Researchers and graduate students in probability, computer science, combinatorics, and optimization theory will all be interested in this collection of articles. The techniques developed and surveyed in this volume are still undergoing rapid development, and many of the articles of the collection offer an expositionally pleasant entree into a research area of growing importance.

This book constitutes the thoroughly referred post-workshop proceedings of the 23rd International Workshop on Combinatorial Algorithms, IWOCA 2012, held in Krishnankoil, Tamil Nadu, India, in July 2012. The 32 revised full papers presented were carefully reviewed and selected from a total of 88 submissions. The papers are organized in topical sections in algorithms and data Structures, applications (including Bioinformatics, Networking, etc.), combinatorics of words and strings, combinatorial optimization, combinatorial enumeration, decompositions and combinatorial designs, complexity theory (structural and computational), computational biology and graph theory and combinatorics submissions.

This book constitutes the refereed proceedings of the 6th International Conference, FUN 2012, held in June 2012 in Venice, Italy. The 34 revised full papers were carefully reviewed and selected from 56 submissions. They feature a large variety of topics in the field of the use, design, and analysis of algorithms and data structures, focusing on results that provide amusing, witty but nonetheless original and scientifically profound contributions to the area.

George Collins'discovery of Cylindrical Algebraic Decomposition (CAD) as a method for Quantifier Elimination (QE) for the elementary theory of real closed fields brought a major breakthrough in automating mathematics with recent important applications in high-tech areas (e.g. robot motion), also stimulating fundamental research in computer algebra over the past three decades. This volume is a state-of-the-art collection of important papers on CAD and QE and on the related area of algorithmic aspects of real geometry. It contains papers from a symposium held in Linz in 1993, reprints of seminal papers from the area including Tarski's landmark paper as well as a survey outlining the developments in CAD based QE that have taken place in the last twenty years.

This book constitutes the refereed proceedings of the 12th International Workshop on Algorithms in Bioinformatics, WABI 2012, held in Ljubljana, Slovenia, in September 2012. WABI 2012 is one of six workshops which, along with the European Symposium on Algorithms (ESA), constitute the ALGO annual meeting and focuses on algorithmic advances in bioinformatics, computational biology, and systems biology with a particular emphasis on discrete algorithms and machine-learning methods that address important problems in molecular biology. The 35 full papers presented were carefully reviewed and selected from 92 submissions. The papers include algorithms for a variety of biological problems including phylogeny, DNA and RNA sequencing and analysis, protein structure, and others.

In 1992 two successive symposia were held in Japan on algorithms, fractals and dynamical systems. The first one was Hayashibara Forum'92: International Symposium on New Bases for Engineering Science, Algorithms, Dynamics and Fractals held at Fujisaki Institute of Hayashibara Biochemical Laboratories, Inc. in Okayama during November 23-28 in which 49 mathematicians including 19 from abroad participated. They include both pure and applied mathematicians of diversified backgrounds and represented 11 coun­ tries. The organizing committee consisted of the following domestic members and Mike KEANE from Delft: Masayosi HATA, Shunji ITO, Yuji ITO, Teturo KAMAE (chairman), Hitoshi NAKADA, Satoshi TAKAHASHI, Yoichiro TAKAHASHI, Masaya YAMAGUTI The second one was held at the Research Institute for Mathematical Science at Kyoto University from November 30 to December 2 with emphasis on pure mathematical side in which more than 80 mathematicians participated. This volume is a partial record of the stimulating exchange of ideas and discussions which took place in these two symposia.

This book constitutes the thoroughly referred post-workshop proceedings of the 22nd International Workshop on Combinatorial Algorithms, IWOCA 2011, held in Victoria, BC, Canada, in July 2011. The 30 revised full papers presented were carefully reviewed and selected from a total of 71 submissions. A broad variety of topics in combinatorics and graph theory are addressed, such as combinatorics on words, string algorithms, codes, Venn diagrams, set partitions; Hamiltonian & Eulerian properties, graph drawing, colouring, dominating sets, spanning trees, and others.

This book constitutes the thoroughly referred post-proceedings of the 21st International Workshop on Combinatorial Algorithms, IWOCA 2010, held in London, UK, in July 2010. The 31 revised full papers presented together with extended abstracts of 8 poster presentations were carefully reviewed and selected from a total of 85 submissions. A broad variety of combinatorial graph algorithms for the computations of various graph features are presented; also algorithms for network compuation, approximation, computational geometry, games, and search are presented and complexity aspects of such algorithms are discussed.

One of the best known fast computational algorithms is the fast Fourier transform method. Its efficiency is based mainly on the special structure of the discrete Fourier transform matrix. Recently, many other algorithms of this type were discovered, and the theory of structured matrices emerged. This volume contains 22 survey and research papers devoted to a variety of theoretical and practical aspects of the design of fast algorithms for structured matrices and related issues. Included are several papers containing various affirmative and negative results in this direction. The theory of rational interpolation is one of the excellent sources providing intuition and methods to design fast algorithms. The volume contains several computational and theoretical papers on the topic. There are several papers on new applications of structured matrices, e.g., to the design of fast decoding algorithms, computing state-space realizations, relations to Lie algebras, unconstrained optimization, solving matrix equations, etc. The book is suitable for mathematicians, engineers, and numerical analysts who design, study, and use fast computational algorithms based on the theory of structured matrices.

Selected, peer reviewed papers from the 2010 International Conference on Micro Nano Devices, Structure and Computing Systems (MNDSCS 2010), Singapore, November 6-7, 2010

This book constitutes the refereed proceedings of the Fourth International Symposium on Algorithmic Game Theory, SAGT 2011, held in Amalfi, Italy, in October 2011. The 26 revised full papers presented together with 2 invited lectures were carefully reviewed and selected from 65 submissions. The papers are organized in topical sections on auctions and advertising, quality of solutions, externalities, mechanism design, complexity, network games, pricing, as well as routing games.

This volume corresponds to the Banff International Research Station Workshop on Randomization, Relaxation, and Complexity, held from February 28–March 5, 2010 in Banff, Alberta, Canada. This volume contains a sample of advanced algorithmic techniques underpinning the solution of systems of polynomial equations. The papers are written by leading experts in algorithmic algebraic geometry and touch upon core topics such as homotopy methods for approximating complex solutions, robust floating point methods for clusters of roots, and speed-ups for counting real solutions. Vital related topics such as circuit complexity, random polynomials over local fields, tropical geometry, and the theory of fewnomials, amoebae, and coamoebae are treated as well. Recent advances on Smale's 17th Problem, which deals with numerical algorithms that approximate a single complex solution in average-case polynomial time, are also surveyed.

For many years Esko Ukkonen has played a major role in the advancement of computer science in Finland. He was the key person in the development of the school of algorithmic research and has contributed considerably to post-graduate education in his country. Esko Ukkonen has over the years worked within many areas of computer science, including numerical methods, complexity theory, theoretical aspects of compiler construction, and logic programming. However, the main focus of his research has been on algorithms and their applications. This Festschrift volume, published to honor Esko Ukkonen on his 60th birthday, includes 18 refereed contributions by his former PhD students and colleagues, with whom he has cooperated closely during the course of his career. The Festschrift was presented to Esko during a festive symposium organized at the University of Helsinki to celebrate his birthday. The essays primarily present research on computational pattern matching and string algorithms, two areas that have benefited significantly from the work of Esko Ukonen.

Property Testing is the study of super-fast (randomized) algorithms for approximate decision making. These algorithms are given direct access to items of a huge data set, and determine, whether this data set has some predetermined (global) property or is far from having this property. Remarkably, this approximate decision is made by accessing a small portion of the data set. This state-of-the-art survey presents a collection of extended abstracts and surveys of leading researchers in property testing and related areas; it reflects the program of a mini-workshop on property testing that took place in January 2010 at the Institute for Computer Science (ITCS), Tsinghua University, Beijing, China. The volume contains two editor's introductions, 10 survey papers and 18 extended abstracts.

This book constitutes the refereed proceedings of the 18th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-18, held in Tarragona, Spain, in June 2009. The 22 revised full papers presented together with 7 extended absstracts were carefully reviewed and selected from 50 submissions. Among the subjects addressed are block codes, including list-decoding algorithms; algebra and codes: rings, fields, algebraic geometry codes; algebra: rings and fields, polynomials, permutations, lattices; cryptography: cryptanalysis and complexity; computational algebra: algebraic algorithms and transforms; sequences and boolean functions.

This book constitutes the refereed proceedings of the 5th International Symposium on Stochastic Algorithms, Foundations and Applications, SAGA 2009, held in Sapporo, Japan, in October 2009. The 15 revised full papers presented together with 2 invited papers were carefully reviewed and selected from 22 submissions. The papers are organized in topical sections on learning, graphs, testing, optimization and caching, as well as stochastic algorithms in bioinformatics.

This book constitutes the refereed proceedings of the Second International Symposium on Algorithmic Game Theory, SAGT 2009, held in Paphos, Cyprus, in October 2009. The 29 revised full papes presented together with 3 invited lectures were carefully reviewed and selected from 55 submissions. The papers are intended to cover all important areas such as solution concepts, game classes, computation of equilibria and market equilibria, algorithmic mechanism design, automated mechanism design, convergence and learning in games, complexity classes in game theory, algorithmic aspects of fixed-point theorems, mechanisms, incentives and coalitions, cost-sharing algorithms, computational problems in economics, finance, decision theory and pricing, computational social choice, auction algorithms, price of anarchy and its relatives, representations of games and their complexity, economic aspects of distributed computing and the internet, congestion, routing and network design and formation games and game-theoretic approaches to networking problems.

These proceedings contain papers from the 2009 Workshop on Algorithms in Bioinformatics (WABI), held at the University of Pennsylvania in Philadelphia, Pennsylvania during September 12–13, 2009. WABI 2009 was the ninth annual conference in this series, which focuses on novel algorithms that address imp- tantproblemsingenomics,molecularbiology,andevolution.Theconference- phasizes research that describes computationally e?cient algorithms and data structures that have been implemented and tested in simulations and on real data. WABI is sponsored by the European Association for Theoretical C- puter Science (EATCS) and the International Society for Computational Bi- ogy (ISCB). WABI 2009 was supported by the Penn Genome Frontiers Institute and the Penn Center for Bioinformatics at the University of Pennsylvania. For the 2009 conference, 90 full papers were submitted for review by the Program Committee, and from this strong?eld of submissions, 34 papers were chosen for presentation at the conference and publication in the proceedings. The?nal programcovered a wide range of topics including gene interaction n- works, molecular phylogeny, RNA and protein structure, and genome evolution.

Algorithms are a fundamental component of robotic systems: they control or reason about motion and perception in the physical world. They receive input from noisy sensors, consider geometric and physical constraints, and operate on the world through imprecise actuators. The design and analysis of robot algorithms therefore raises a unique combination of questions in control theory, computational and differential geometry, and computer science. This book contains the proceedings from the 2006 Workshop on the Algorithmic Foundations of Robotics. This biannual workshop is a highly selective meeting of leading researchers in the field of algorithmic issues related to robotics. The 32 papers in this book span a wide variety of topics: from fundamental motion planning algorithms to applications in medicine and biology, but they have in common a foundation in the algorithmic problems of robotic systems.

In the last decade, there has been a burgeoning of activity in the design and implementation of algorithms for algebraic geometric compuation. Some of these algorithms were originally designed for abstract algebraic geometry, but now are of interest for use in applications and some of these algorithms were originally designed for applications, but now are of interest for use in abstract algebraic geometry. The workshop on Algorithms in Algebraic Geometry that was held in the framework of the IMA Annual Program Year in Applications of Algebraic Geometry by the Institute for Mathematics and Its Applications on September 18-22, 2006 at the University of Minnesota is one tangible indication of the interest. One hundred ten participants from eleven countries and twenty states came to listen to the many talks; discuss mathematics; and pursue collaborative work on the many faceted problems and the algorithms, both symbolic and numberic, that illuminate them. This volume of articles captures some of the spirit of the IMA workshop.

Advances in Computational Algorithms and Data Analysis offers state of the art tremendous advances in computational algorithms and data analysis. The selected articles are representative in these subjects sitting on the top-end-high technologies. The volume serves as an excellent reference work for researchers and graduate students working on computational algorithms and data analysis.

This book constitutes the refereed proceedings of the 7th International Workshop on Algorithms in Bioinformatics, WABI 2007, held in Philadelphia, PA, USA in September 2007. The 38 revised full papers presented together with the abstract of a keynote talk were carefully reviewed and selected from 133 submissions. All current issues of algorithms in bioinformatics are addressed, ranging from mathematical tools to experimental studies of approximation algorithms and reports on significant computational analyses. Numerous biological problems are dealt with, including genetic mapping, sequence alignment and sequence analysis, phylogeny, comparative genomics, and protein structure. Furthermore the papers feature high-performance computing approaches to computationally hard learning and optimization problems in bioinformatics and cover methods, software and dataset repositories for development and testing of such algorithms and their underlying models.

This volume is the proceedings of a conference on Finite Geometries, Groups, and Computation that took place on September 4-9, 2004, at Pingree Park, Colorado (a campus of Colorado State University). Not accidentally, the conference coincided with the 60th birthday of William Kantor, and the topics relate to his major research areas. Participants were encouraged to explore the deeper interplay between these fields. The survey papers by Kantor, O'Brien, and Penttila should serve to introduce both students and the broader mathematical community to these important topics and some of their connections while the volume as a whole gives an overview of current developments in these fields.

This book constitutes the refereed proceedings of the 10th Scandinavian Workshop on Algorithm Theory, SWAT 2006, held in Riga, Latvia, in July 2006. The proceedings includes 36 revised full papers presented together with 3 invited papers, addressing issues of theoretical algorithmics and applications in various fields including graph algorithms, computational geometry, scheduling, approximation algorithms, network algorithms, data storage and manipulation, combinatorics, sorting, searching, online algorithms, optimization, amd more.

The 25 revised full papers presented here together with 7 invited papers address subjects such as block codes; algebra and codes: rings, fields, and AG codes; cryptography; sequences; decoding algorithms; and algebra: constructions in algebra, Galois groups, differential algebra, and polynomials.