Abstract is missing.
- Analysis of Scheduling Algorithms for Proportionate FairnessMike Paterson. 1 [doi]
- Advances in the Regularity MethodYoshiharu Kohayakawa. 2 [doi]
- Fighting Spam: The ScienceCynthia Dwork. 3-4 [doi]
- The Consequences of Imre Simon s Work in the Theory of Automata, Languages, and SemigroupsJean-Eric Pin. 5 [doi]
- Querying Priced Information in Databases: The Conjunctive CaseEduardo Sany Laber, Renato Carmo, Yoshiharu Kohayakawa. 6-15 [doi]
- Sublinear Methods for Detecting Periodic Trends in Data StreamsFunda Ergün, S. Muthukrishnan, Süleyman Cenk Sahinalp. 16-28 [doi]
- An Improved Data Stream Summary: The Count-Min Sketch and Its ApplicationsGraham Cormode, S. Muthukrishnan. 29-38 [doi]
- Rotation and Lighting Invariant Template MatchingKimmo Fredriksson, Veli Mäkinen, Gonzalo Navarro. 39-48 [doi]
- Computation of the Bisection Width for Random d-Regular GraphsJosep Díaz, Maria J. Serna, Nicholas C. Wormald. 49-58 [doi]
- Constrained Integer PartitionsChristian Borgs, Jennifer T. Chayes, Stephan Mertens, Boris Pittel. 59-68 [doi]
- Embracing the Giant ComponentAbraham Flaxman, David Gamarnik, Gregory B. Sorkin. 69-79 [doi]
- Sampling Grid Colorings with Fewer ColorsDimitris Achlioptas, Michael S. O. Molloy, Cristopher Moore, Frank Van Bussel. 80-89 [doi]
- The Complexity of Finding Top-Toda-Equivalence-Class MembersLane A. Hemaspaandra, Mitsunori Ogihara, Mohammed Javeed Zaki, Marius Zimand. 90-99 [doi]
- List Partitions of Chordal GraphsTomás Feder, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti. 100-108 [doi]
- Bidimensional Parameters and Local TreewidthErik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos. 109-118 [doi]
- Vertex Disjoint Paths on Clique-Width Bounded GraphsFrank Gurski, Egon Wanke. 119-128 [doi]
- On Partitioning Interval and Circular-Arc Graphs into Proper Interval Subgraphs with ApplicationsFrédéric Gardi. 129-140 [doi]
- Collective Tree ExplorationPierre Fraigniaud, Leszek Gasieniec, Dariusz R. Kowalski, Andrzej Pelc. 141-151 [doi]
- O.-Centers: A New Type of Steiner Points for Computing Size-Optimal Quality-Guaranteed Delaunay TriangulationsAlper Üngör. 152-161 [doi]
- Space-E.cient Algorithms for Computing the Convex Hull of a Simple Polygonal Line in Linear TimeHervé Brönnimann, Timothy M. Chan. 162-171 [doi]
- A Geometric Approach to the Bisection MethodClaudio Gutiérrez, Flavio Gutierrez, Maria-Cecilia Rivara. 172-180 [doi]
- Improved Linear Expected-Time Algorithms for Computing MaximaH. K. Dai, Xi-Wen Zhang. 181-192 [doi]
- A Constant Approximation Algorithm for Sorting BuffersJens S. Kohrt, Kirk Pruhs. 193-202 [doi]
- Approximation Schemes for a Class of Subset Selection ProblemsKirk Pruhs, Gerhard J. Woeginger. 203-211 [doi]
- Finding k-Connected Subgraphs with Minimum Average WeightPrabhakar Gubbala, Balaji Raghavachari. 212-221 [doi]
- On the (Im)possibility of Non-interactive Correlation DistillationKe Yang. 222-231 [doi]
- Pure Future Local Temporal Logics Are Expressively Complete for Mazurkiewicz TracesVolker Diekert, Paul Gastin. 232-241 [doi]
- How Expressions Can Code for AutomataSylvain Lombardy, Jacques Sakarovitch. 242-251 [doi]
- Automata for Arithmetic Meyer SetsShigeki Akiyama, Frédérique Bassino, Christiane Frougny. 252-261 [doi]
- Effciently Computing the Density of Regular LanguagesManuel Bodirsky, Tobias Gärtner, Timo von Oertzen, Jan Schwinghammer. 262-270 [doi]
- Longest Repeats with a Block of Don t CaresMaxime Crochemore, Costas S. Iliopoulos, Manal Mohamed, Marie-France Sagot. 271-278 [doi]
- Join Irreducible Pseudovarieties, Group Mapping, and Kovács-Newman SemigroupsJohn Rhodes, Benjamin Steinberg. 279-291 [doi]
- Complementation of Rational Sets on Scattered Linear Orderings of Finite RankOlivier Carton, Chloe Rispal. 292-301 [doi]
- Expected Length of the Longest Common Subsequence for Large AlphabetsMarcos A. Kiwi, Martin Loebl, Jirí Matousek. 302-311 [doi]
- Universal Types and Simulation of Individual SequencesGadiel Seroussi. 312-321 [doi]
- Separating Codes: Constructions and BoundsGérard D. Cohen, Hans Georg Schaathun. 322-328 [doi]
- Encoding Homotopy of Paths in the PlaneSergei Bespamyatnikh. 329-338 [doi]
- A Unified Approach to Coding Labeled TreesSaverio Caminiti, Irene Finocchi, Rossella Petreschi. 339-348 [doi]
- Cost-Optimal Trees for Ray ShootingHervé Brönnimann, Marc Glisse. 349-358 [doi]
- Packing Problems with Orthogonal RotationsFlávio Keidi Miyazawa, Yoshiko Wakabayashi. 359-368 [doi]
- Combinatorial Problems on Strings with Applications to Protein FoldingAlantha Newman, Matthias Ruhl. 369-378 [doi]
- Measurement Errors Make the Partial Digest Problem NP-HardMark Cieliebak, Stephan Eidenbenz. 379-390 [doi]
- Designing Small Keyboards Is HardJean Cardinal, Stefan Langerman. 391-400 [doi]
- Metric Structures in L1: Dimension, Snowflakes, and Average DistortionJames R. Lee, Manor Mendel, Assaf Naor. 401-412 [doi]
- Nash Equilibria via Polynomial EquationsRichard J. Lipton, Evangelos Markakis. 413-422 [doi]
- Minimum Latency Tours and the k-Traveling Repairmen ProblemRaja Jothi, Balaji Raghavachari. 423-433 [doi]
- Server Scheduling in the Weighted l::p:: NormNikhil Bansal, Kirk Pruhs. 434-443 [doi]
- An Improved Communication-Randomness TradeoMartin Fürer. 444-454 [doi]
- Distributed Games and Distributed Control for Asynchronous SystemsPaul Gastin, Benjamin Lerman, Marc Zeitoun. 455-465 [doi]
- A Simplified, Dynamic Unified StructureMihai Badoiu, Erik D. Demaine. 466-473 [doi]
- Another View of the Gaussian AlgorithmAli Akhavi, Céline Moreira Dos Santos. 474-487 [doi]
- Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-IntersectionsEndre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan. 488-498 [doi]
- Rooted Maximum Agreement SupertreesJesper Jansson, Joseph H.-K. Ng, Kunihiko Sadakane, Wing-Kin Sung. 499-508 [doi]
- Complexity of Cycle Length Modularity Problems in GraphsEdith Hemaspaandra, Holger Spakowski, Mayur Thakur. 509-518 [doi]
- Procedural Semantics for Fuzzy Disjunctive Programs on Residuated LatticesDusan Guller. 519-529 [doi]
- A Proof System and a Decision Procedure for Equality LogicOlga Tveretina, Hans Zantema. 530-539 [doi]
- Approximating the Expressive Power of Logics in Finite ModelsArgimiro Arratia, Carlos E. Ortiz. 540-556 [doi]
- Arithmetic Circuits for Discrete LogarithmsJoachim von zur Gathen. 557-566 [doi]
- On the Competitiveness of AIMD-TCP within a General NetworkJeff Edmonds. 567-576 [doi]
- Gathering Non-oblivious Mobile RobotsMark Cieliebak. 577-588 [doi]
- Bisecting and Gossiping in Circulant GraphsBernard Mans, Igor Shparlinski. 589-598 [doi]
- Multiple Mobile Agent Rendezvous in a RingPaola Flocchini, Evangelos Kranakis, Danny Krizanc, Nicola Santoro, Cindy Sawchuk. 599-608 [doi]
- Global Synchronization in SensornetsJeremy Elson, Richard M. Karp, Christos H. Papadimitriou, Scott Shenker. 609-624 [doi]