Abstract is missing.
- Algorithmic Challenges in Web Search EnginesRicardo A. Baeza-Yates. 1-7 [doi]
- RNA Molecules: Glimpses Through an Algorithmic LensAnne Condon. 8-10 [doi]
- SquaresFerran Hurtado. 11-12 [doi]
- Matching Based Augmentations for Approximating Connectivity ProblemsR. Ravi. 13-24 [doi]
- Modelling Errors and Recovery for CommunicationMadhu Sudan. 25-25 [doi]
- Lossless Data Compression Via Error CorrectionSergio Verdú. 26-27 [doi]
- The Power and Weakness of Randomness in ComputationAvi Wigderson. 28-29 [doi]
- A New GCD Algorithm for Quadratic Number Rings with Unique FactorizationSaurabh Agarwal, Gudmund Skovbjerg Frandsen. 30-42 [doi]
- On Clusters in Markov ChainsNir Ailon, Steve Chien, Cynthia Dwork. 43-55 [doi]
- An Architecture for Provably Secure ComputationMiklós Ajtai, Cynthia Dwork, Larry J. Stockmeyer. 56-67 [doi]
- Scoring Matrices That Induce Metrics on SequencesElói Araújo, José Soares. 68-79 [doi]
- Data Structures for Halfplane Proximity Queries and Incremental Voronoi DiagramsBoris Aronov, Prosenjit Bose, Erik D. Demaine, Joachim Gudmundsson, John Iacono, Stefan Langerman, Michiel H. M. Smid. 80-92 [doi]
- The Complexity of Diffuse Reflections in a Simple PolygonBoris Aronov, Alan R. Davis, John Iacono, Albert Siu Cheong Yu. 93-104 [doi]
- Counting Proportions of Sets: Expressive Power with Almost OrderArgimiro Arratia, Carlos E. Ortiz. 105-117 [doi]
- Efficient Approximate Dictionary Look-Up for Long Words over Small AlphabetsAbdullah N. Arslan. 118-129 [doi]
- Relations Among Notions of Security for Identity Based Encryption SchemesNuttapong Attrapadung, Yang Cui, David Galindo, Goichiro Hanaoka, Ichiro Hasuo, Hideki Imai, Kanta Matsuura, Peng Yang 0002, Rui Zhang 0002. 130-141 [doi]
- Optimally Adaptive Integration of Univariate Lipschitz FunctionsIlya Baran, Erik D. Demaine, Dmitriy A. Katz. 142-153 [doi]
- Classical Computability and Fuzzy Turing MachinesBenjamín René Callejas Bedregal, Santiago Figueira. 154-165 [doi]
- An Optimal Algorithm for the Continuous/Discrete Weighted 2-Center Problem in TreesBoaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi. 166-177 [doi]
- An Algorithm for a Generalized Maximum Subsequence ProblemThorsten Bernholt, Thomas Hofmeister. 178-189 [doi]
- Random Bichromatic MatchingsNayantara Bhatnagar, Dana Randall, Vijay V. Vazirani, Eric Vigoda. 190-201 [doi]
- Eliminating Cycles in the Discrete TorusBéla Bollobás, Guy Kindler, Imre Leader, Ryan O Donnell. 202-210 [doi]
- On Behalf of the Seller and Society: Bicriteria Mechanisms for Unit-Demand AuctionsClaudson F. Bornstein, Eduardo Sany Laber, Marcelo Mas. 211-223 [doi]
- Pattern Matching Statistics on Correlated SourcesJérémie Bourdon, Brigitte Vallée. 224-237 [doi]
- Robust Model-Checking of Linear-Time Properties in Timed AutomataPatricia Bouyer, Nicolas Markey, Pierre-Alain Reynier. 238-249 [doi]
- The Computational Complexity of the Parallel Knock-Out ProblemHajo Broersma, Matthew Johnson 0002, Daniël Paulusma, Iain A. Stewart. 250-261 [doi]
- Reconfigurations in Graphs and GridsGruia Calinescu, Adrian Dumitrescu, János Pach. 262-273 [doi]
- C-Varieties, Actions and Wreath ProductLaura Chaubard. 274-285 [doi]
- Local Construction of Planar Spanners in Unit Disk Graphs with Irregular Transmission RangesEdgar Chávez, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia. 286-297 [doi]
- An Efficient Approximation Algorithm for Point Pattern Matching Under NoiseVicky Choi, Navin Goyal. 298-310 [doi]
- Oblivious Medians Via Online BiddingMarek Chrobak, Claire Kenyon, John Noga, Neal E. Young. 311-322 [doi]
- Efficient Computation of the Relative Entropy of Probabilistic AutomataCorinna Cortes, Mehryar Mohri, Ashish Rastogi, Michael Riley. 323-336 [doi]
- A Parallel Algorithm for Finding All Successive Minimal Maximum SubsequencesHo-Kwok Dai, Hung-Chi Su. 337-348 [doi]
- De Dictionariis Dynamicis Pauco Spatio Utentibus (::::lat.:::: On Dynamic Dictionaries Using Little Space)Erik D. Demaine, Friedhelm Meyer auf der Heide, Rasmus Pagh, Mihai Patrascu. 349-361 [doi]
- Customized Newspaper Broadcast: Data Broadcast with DependenciesSandeep Dey, Nicolas Schabanel. 362-373 [doi]
- On Minimum ::::k::::-Modal Partitions of PermutationsGabriele Di Stefano, Stefan Krause, Marco E. Lübbecke, Uwe T. Zimmermann. 374-385 [doi]
- Two Birds with One Stone: The Best of Branchwidth and Treewidth with One AlgorithmFrederic Dorn, Jan Arne Telle. 386-397 [doi]
- Maximizing Throughput in Queueing Networks with Limited FlexibilityDouglas G. Down, George Karakostas. 398-409 [doi]
- Network Flow SpannersFeodor F. Dragan, Chenyu Yan. 410-422 [doi]
- Finding All Minimal Infrequent Multi-dimensional IntervalsKhaled M. Elbassioni. 423-434 [doi]
- Cut Problems in Graphs with a Budget ConstraintRoee Engelberg, Jochen Könemann, Stefano Leonardi, Joseph Naor. 435-446 [doi]
- Lower Bounds for Clear Transmissions in Radio NetworksMartin Farach-Colton, Rohan J. Fernandes, Miguel A. Mosteiro. 447-454 [doi]
- Asynchronous Behavior of Double-Quiescent Elementary Cellular AutomataNazim Fatès, Damien Regnault, Nicolas Schabanel, Eric Thierry. 455-466 [doi]
- Lower Bounds for Geometric Diameter ProblemsHervé Fournier, Antoine Vigneron. 467-478 [doi]
- Connected Treewidth and Connected Graph SearchingPierre Fraigniaud, Nicolas Nisse. 479-490 [doi]
- A Faster Algorithm for Finding Maximum Independent Sets in Sparse GraphsMartin Fürer. 491-501 [doi]
- The Committee Decision ProblemEli Gafni, Sergio Rajsbaum, Michel Raynal, Corentin Travers. 502-514 [doi]
- Common Deadline Lazy Bureaucrat Scheduling RevisitedLing Gai, Guochuan Zhang. 515-523 [doi]
- Approximate SortingJoachim Giesen, Eva Schuberth, Milos Stojakovic. 524-531 [doi]
- Stochastic Covering and AdaptivityMichel X. Goemans, Jan Vondrák. 532-543 [doi]
- Algorithms for Modular Counting of Roots of Multivariate PolynomialsParikshit Gopalan, Venkatesan Guruswami, Richard J. Lipton. 544-555 [doi]
- Hardness Amplification Via Space-Efficient Direct ProductsVenkatesan Guruswami, Valentine Kabanets. 556-568 [doi]
- The Online Freeze-Tag ProblemMikael Hammar, Bengt J. Nilsson, Mia Persson. 569-579 [doi]
- I/O-Efficient Algorithms on Near-Planar GraphsHerman J. Haverkort, Laura Toma. 580-591 [doi]
- Minimal Split Completions of GraphsPinar Heggernes, Federico Mancini. 592-604 [doi]
- Design and Analysis of Online Batching SystemsRegant Y. S. Hung, Hing-Fung Ting. 605-616 [doi]
- Competitive Analysis of Scheduling Algorithms for Aggregated LinksWojciech Jawor, Marek Chrobak, Christoph Dürr. 617-628 [doi]
- A 4-Approximation Algorithm for Guarding 1.5-Dimensional TerrainsJames King. 629-640 [doi]
- On Sampling in Higher-Dimensional Peer-to-Peer SystemsGoran Konjevod, Andréa W. Richa, Donglin Xia. 641-652 [doi]
- Mobile Agent Rendezvous in a Synchronous TorusEvangelos Kranakis, Danny Krizanc, Euripides Markou. 653-664 [doi]
- Randomly Colouring Graphs with Girth Five and Large Maximum DegreeLap Chi Lau, Michael Molloy. 665-676 [doi]
- Packing Dicycle Covers in Planar Graphs with No ::::K::::::5::-::::e:::: MinorOrlando Lee, Aaron Williams. 677-688 [doi]
- Sharp Estimates for the Main Parameters of the Euclid AlgorithmLoïck Lhote, Brigitte Vallée. 689-702 [doi]
- Position-Restricted Substring SearchingVeli Mäkinen, Gonzalo Navarro. 703-714 [doi]
- Rectilinear Approximation of a Set of Points in the PlaneYan Mayster, Mario A. Lopez. 715-726 [doi]
- The Branch-Width of Circular-Arc GraphsFrédéric Mazoit. 727-736 [doi]
- Minimal Eulerian Circuit in a Labeled DigraphEduardo Moreno, Martín Matamala. 737-744 [doi]
- Speeding up Approximation Algorithms for NP-Hard Spanning Forest Problems by Multi-objective OptimizationFrank Neumann, Marco Laumanns. 745-756 [doi]
- RISOTTO: Fast Extraction of Motifs with MismatchesNadia Pisanti, Alexandra M. Carvalho, Laurent Marsan, Marie-France Sagot. 757-768 [doi]
- Minimum Cost Source Location Problems with Flow RequirementsMariko Sakashita, Kazuhisa Makino, Satoru Fujishige. 769-780 [doi]
- Exponential Lower Bounds on the Space Complexity of OBDD-Based Graph AlgorithmsDaniel Sawitzki. 781-792 [doi]
- Constructions of Approximately Mutually Unbiased BasesIgor Shparlinski, Arne Winterhof. 793-799 [doi]
- Improved Exponential-Time Algorithms for Treewidth and Minimum Fill-InYngve Villanger. 800-811 [doi]