Abstract is missing.
- Proving Integrality Gaps without Knowing the Linear ProgramSanjeev Arora. 1 [doi]
- An Improved Analysis of Goemans and Williamson s LP-Relaxation for MAX SATTakao Asano. 2-14 [doi]
- Certifying Unsatisfiability of Random 2::::k::::-SAT Formulas Using Approximation TechniquesAmin Coja-Oghlan, Andreas Goerdt, André Lanka, Frank Schädlich. 15-26 [doi]
- Inapproximability Results for Bounded Variants of Optimization ProblemsMiroslav Chlebík, Janka Chlebíková. 27-38 [doi]
- Approximating the Pareto Curve with Local Search for the Bicriteria TSP (1, 2) ProblemEric Angel, Evripidis Bampis, Laurent Gourvès. 39-48 [doi]
- Scheduling to Minimize Max Flow Time: Offline and Online AlgorithmsMonaldo Mastrolilli. 49-60 [doi]
- Linear Time Algorithms for Some NP-Complete Problems on (P::5::, Gem)-Free GraphsHans Leo Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy Spinrad. 61-72 [doi]
- Graph Searching, Elimination Trees, and a Generalization of BandwidthFedor V. Fomin, Pinar Heggernes, Jan Arne Telle. 73-85 [doi]
- Constructing Sparse t-Spanners with Small SeparatorsJoachim Gudmundsson. 86-97 [doi]
- Composing Equipotent TeamsMark Cieliebak, Stephan Eidenbenz, Aris Pagourtzis. 98-108 [doi]
- Efficient Algorithms for GCD and Cubic Residuosity in the Ring of Eisenstein IntegersIvan Damgård, Gudmund Skovbjerg Frandsen. 109-117 [doi]
- An Extended Quadratic Frobenius Primality Test with Average and Worst Case Error EstimatesIvan Damgård, Gudmund Skovbjerg Frandsen. 118-131 [doi]
- Periodic Multisorting Comparator NetworksMarcin Kik. 132-143 [doi]
- Fast Periodic Correction NetworksGrzegorz Stachowiak. 144-156 [doi]
- Games and NetworksChristos H. Papadimitriou. 157 [doi]
- One-Way Communication Complexity of Symmetric Boolean FunctionsJan Arpe, Andreas Jakoby, Maciej Liskiewicz. 158-170 [doi]
- Circuits on CylindersKristoffer Arnsfelt Hansen, Peter Bro Miltersen, V. Vinay. 171-182 [doi]
- Fast Perfect Phylogeny Haplotype InferencePeter Damaschke. 183-194 [doi]
- On Exact and Approximation Algorithms for Distinguishing Substring SelectionJens Gramm, Jiong Guo, Rolf Niedermeier. 195-209 [doi]
- Complexity of Approximating Closest Substring ProblemsPatricia A. Evans, Andrew D. Smith. 210-221 [doi]
- On Lawson s Oriented Walk in Random Delaunay TriangulationsBinhai Zhu. 222-233 [doi]
- Competitive Exploration of Rectilinear PolygonsMikael Hammar, Bengt J. Nilsson, Mia Persson. 234-245 [doi]
- An Improved Approximation Algorithm for Computing Geometric Shortest PathsLyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack. 246-257 [doi]
- Adaptive and Compact Discretization for Weighted Region Optimal Path FindingZheng Sun, John H. Reif. 258-270 [doi]
- On Boundaries of Highly Visible Spaces and ApplicationsJohn H. Reif, Zheng Sun. 271-283 [doi]
- Membrane ComputingGheorghe Paun. 284-295 [doi]
- Classical Simulation Complexity of Quantum MachinesFarid M. Ablayev, Aida Gainutdinova. 296-302 [doi]
- Using Depth to Capture Average-Case ComplexityLuis Antunes 0002, Lance Fortnow, N. V. Vinodchandran. 303-310 [doi]
- Non-uniform Depth of Polynomial Time and Space SimulationsRichard J. Lipton, Anastasios Viglas. 311-320 [doi]
- Dimension- and Time-Hierarchies for Small Time BoundsMartin Kutrib. 321-332 [doi]
- Baire s Categories on Small Complexity ClassesPhilippe Moser. 333-342 [doi]
- Operations Preserving Recognizable LanguagesJean Berstel, Luc Boasson, Olivier Carton, Bruno Petazzoni, Jean-Eric Pin. 343-354 [doi]
- Languages Defined by Generalized Equality SetsVesa Halava, Tero Harju, Hendrik Jan Hoogeboom, Michel Latteux. 355-363 [doi]
- Context-Sensitive Equivalences for Non-interference Based Protocol AnalysisMichele Bugliesi, Ambra Ceccato, Sabina Rossi. 364-375 [doi]
- On the Exponentiation of LanguagesWerner Kuich, Klaus W. Wagner. 376-386 [doi]
- Kleene s Theorem for Weighted Tree-AutomataChristian Pech. 387-399 [doi]
- Weak Cardinality Theorems for First-Order LogicTill Tantau. 400-411 [doi]
- Compositionality of Hennessy-Milner Logic through Structural Operational SemanticsWan Fokkink, Rob J. van Glabbeek, Paulien de Wind. 412-422 [doi]
- On a Logical Approach to Estimating Computational Complexity of Potentially Intractable ProblemsAndrzej Szalas. 423-431 [doi]