Table of Contents

• Logic as a Query Language: From Frege to XMLVictor Vianu. 1-12 [doi]
• How Does Computer Science Change Molecular Biology?Alain Viari. 13 [doi]
• Improved Compact Visibility Representation of Planar Graph via Schnyder s RealizerChing-Chi Lin, Hsueh-I Lu, I-Fan Sun. 14-25 [doi]
• Rectangle Visibility Graphs: Characterization, Construction, and CompactionIleana Streinu, Sue Whitesides. 26-37 [doi]
• Approximating Geometric Bottleneck Shortest PathsProsenjit Bose, Anil Maheshwari, Giri Narasimhan, Michiel H. M. Smid, Norbert Zeh. 38-49 [doi]
• Optimization in ArrangementsStefan Langerman, William L. Steiger. 50-61 [doi]
• Complete Classifications for the Communication Complexity of Regular LanguagesPascal Tesson, Denis Thérien. 62-73 [doi]
• The Commutation with Codes and Ternary Sets of WordsJuhani Karhumäki, Michel Latteux, Ion Petre. 74-84 [doi]
• On the Confluence of Linear Shallow Term Rewrite SystemsGuillem Godoy, Ashish Tiwari, Rakesh M. Verma. 85-96 [doi]
• Wadge Degrees of omega-Languages of Deterministic Turing MachinesVictor L. Selivanov. 97-108 [doi]
• Faster Deterministic Broadcasting in Ad Hoc Radio NetworksDariusz R. Kowalski, Andrzej Pelc. 109-120 [doi]
• Private Computations in Networks: Topology versus RandomnessAndreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk. 121-132 [doi]
• On Shortest-Path All-Optical Networks without Wavelength Conversion RequirementsThomas Erlebach, Stamatis Stefanakos. 133-144 [doi]
• Lattice Reduction by Random Sampling and Birthday MethodsClaus-Peter Schnorr. 145-156 [doi]
• On the Ultimate Complexity of FactorialsQi Cheng. 157-166 [doi]
• On the Effective Jordan DecomposabilityXizhong Zheng, Robert Rettinger, Burchard von Braunmühl. 167-178 [doi]
• Fast Algorithms for Extended Regular Expression Matching and SearchingLucian Ilie, Baozhen Shan, Sheng Yu. 179-190 [doi]
• Algorithms for Transposition Invariant String MatchingVeli Mäkinen, Gonzalo Navarro, Esko Ukkonen. 191-202 [doi]
• On the Complexity of Finding a Local Maximum of Functions on Discrete Planar SubsetsAnton Mityagin. 203-211 [doi]
• Some Results on DerandomizationHarry Buhrman, Lance Fortnow, Aduri Pavan. 212-222 [doi]
• On the Representation of Boolean Predicates of the Diffie-Hellman FunctionEike Kiltz. 223-233 [doi]
• Quantum Circuits with Unbounded Fan-outPeter Høyer, Robert Spalek. 234-246 [doi]
• Analysis of the Harmonic Algorithm for Three ServersMarek Chrobak, Jiri Sgall. 247-259 [doi]
• Non-clairvoyant Scheduling for Minimizing Mean SlowdownNikhil Bansal, Kedar Dhamdhere, Jochen Könemann, Amitabh Sinha. 260-270 [doi]
• Space Efficient Hash Tables with Worst Case Constant Access TimeDimitris Fotakis, Rasmus Pagh, Peter Sanders, Paul G. Spirakis. 271-282 [doi]
• Randomized Jumplists: A Jump-and-Walk Dictionary Data StructureHervé Brönnimann, Frédéric Cazals, Marianne Durand. 283-294 [doi]
• Complexity Theoretical Results on Nondeterministic Graph-Driven Read-Once Branching ProgramsBeate Bollig. 295-306 [doi]
• Randomness versus Nondeterminism for Read-Once and Read- k Branching ProgramsMartin Sauerhoff. 307-318 [doi]
• Branch-Width, Parse Trees, and Monadic Second-Order Logic for MatroidsPetr Hlinený. 319-330 [doi]
• Algebraic Characterizations of Small Classes of Boolean FunctionsRicard Gavaldà, Denis Thérien. 331-342 [doi]
• On the Difficulty of Some Shortest Path ProblemsJohn Hershberger, Subhash Suri, Amit M. Bhosle. 343-354 [doi]
• Representing Graph Metrics with Fewest EdgesTomás Feder, Adam Meyerson, Rajeev Motwani, Liadan O Callaghan, Rina Panigrahy. 355-366 [doi]
• Computing Shortest Paths with UncertaintyTomás Feder, Rajeev Motwani, Liadan O Callaghan, Chris Olston, Rina Panigrahy. 367-378 [doi]
• Solving Order Constraints in Logarithmic SpaceAndrei A. Krokhin, Benoit Larose. 379-390 [doi]
• The Inversion Problem for Computable Linear OperatorsVasco Brattka. 391-402 [doi]
• Algebras of Minimal Rank over Arbitrary FieldsMarkus Bläser. 403-414 [doi]
• Evolutionary Algorithms and the Maximum Matching ProblemOliver Giel, Ingo Wegener. 415-426 [doi]
• Alternative Algorithms for Counting All Matchings in GraphsPiotr Sankowski. 427-438 [doi]
• Strong Stability in the Hospitals/Residents ProblemRobert W. Irving, David Manlove, Sandy Scott. 439-450 [doi]
• The Inference Problem for Propositional Circumscription of Affine Formulas Is coNP-CompleteArnaud Durand, Miki Hermann. 451-462 [doi]
• Decidable Theories of Cayley-GraphsDietrich Kuske, Markus Lohrey. 463-474 [doi]
• The Complexity of Resolution with Generalized Symmetry RulesStefan Szeider. 475-486 [doi]
• Colouring Random Graphs in Expected Polynomial TimeAmin Coja-Oghlan, Anusch Taraz. 487-498 [doi]
• An Information-Theoretic Upper Bound of Planar Graphs Using TriangulationNicolas Bonichon, Cyril Gavoille, Nicolas Hanusse. 499-510 [doi]
• Finding Large Independent Sets in Polynomial Expected TimeAmin Coja-Oghlan. 511-522 [doi]
• Distributed Soft Path ColoringPeter Damaschke. 523-534 [doi]
• Competing Provers Yield Improved Karp-Lipton Collapse ResultsJin-yi Cai, Venkatesan T. Chakaravarthy, Lane A. Hemaspaandra, Mitsunori Ogihara. 535-546 [doi]
• One Bit of AdviceHarry Buhrman, Richard Chang, Lance Fortnow. 547-558 [doi]
• Strong Reductions and Immunity for Exponential TimeMarcus Schaefer, Frank Stephan. 559-570 [doi]
• The Complexity of Membership Problems for Circuits over Sets of Natural NumbersPierre McKenzie, Klaus W. Wagner. 571-582 [doi]
• Performance Ratios for the Differencing Method Applied to the Balanced Number Partitioning ProblemWil Michiels, Jan H. M. Korst, Emile H. L. Aarts, Jan van Leeuwen. 583-595 [doi]
• Cake-Cutting Is Not a Piece of CakeMalik Magdon-Ismail, Costas Busch, Mukkai S. Krishnamoorthy. 596-607 [doi]
• The Price of Truth: Frugality in Truthful MechanismsKunal Talwar. 608-619 [doi]
• Untameable Timed Automata!Patricia Bouyer. 620-631 [doi]
• The Intrinsic Universality Problem of One-Dimensional Cellular AutomataNicolas Ollinger. 632-641 [doi]
• On Sand AutomataJulien Cervelle, Enrico Formenti. 642-653 [doi]
• Adaptive Sorting and the Information Theoretic Lower BoundAmr Elmasry, Michael L. Fredman. 654-662 [doi]
• A Discrete Subexponential Algorithm for Parity GamesHenrik Björklund, Sven Sandberg, Sergei G. Vorobyov. 663-674 [doi]
• Cryptographically Sound and Machine-Assisted Verification of Security ProtocolsMichael Backes, Christian Jacobi 0002. 675-686 [doi]
• Durations, Parametric Model-Checking in Timed Automata with Presburger ArithmeticVéronique Bruyère, Emmanuel Dall Olio, Jean-François Raskin. 687-698 [doi]