default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID14th FCT 2003: Malmö, Sweden
- Andrzej Lingas, Bengt J. Nilsson:
Fundamentals of Computation Theory, 14th International Symposium, FCT 2003, Malmö, Sweden, August 12-15, 2003, Proceedings. Lecture Notes in Computer Science 2751, Springer 2003, ISBN 3-540-40543-7
Approximability 1
- Sanjeev Arora:
Proving Integrality Gaps without Knowing the Linear Program. 1 - Takao Asano:
An Improved Analysis of Goemans and Williamson's LP-Relaxation for MAX SAT. 2-14 - Amin Coja-Oghlan, Andreas Goerdt, André Lanka, Frank Schädlich:
Certifying Unsatisfiability of Random 2k-SAT Formulas Using Approximation Techniques. 15-26
Approximability 2
- Miroslav Chlebík
, Janka Chlebíková:
Inapproximability Results for Bounded Variants of Optimization Problems. 27-38 - Eric Angel, Evripidis Bampis, Laurent Gourvès:
Approximating the Pareto Curve with Local Search for the Bicriteria TSP (1, 2) Problem. 39-48 - Monaldo Mastrolilli:
Scheduling to Minimize Max Flow Time: Offline and Online Algorithms. 49-60
Algorithms 1
- Hans L. Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy P. Spinrad:
Linear Time Algorithms for Some NP-Complete Problems on (P5, Gem)-Free Graphs. 61-72 - Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle:
Graph Searching, Elimination Trees, and a Generalization of Bandwidth. 73-85 - Joachim Gudmundsson:
Constructing Sparse t-Spanners with Small Separators. 86-97 - Mark Cieliebak, Stephan J. Eidenbenz, Aris Pagourtzis:
Composing Equipotent Teams. 98-108
Algorithms 2
- Ivan Damgård, Gudmund Skovbjerg Frandsen:
Efficient Algorithms for GCD and Cubic Residuosity in the Ring of Eisenstein Integers. 109-117 - Ivan Damgård, Gudmund Skovbjerg Frandsen:
An Extended Quadratic Frobenius Primality Test with Average and Worst Case Error Estimates. 118-131 - Marcin Kik:
Periodic Multisorting Comparator Networks. 132-143 - Grzegorz Stachowiak:
Fast Periodic Correction Networks. 144-156
Networks and Complexity
- Christos H. Papadimitriou:
Games and Networks. 157 - Jan Arpe, Andreas Jakoby, Maciej Liskiewicz:
One-Way Communication Complexity of Symmetric Boolean Functions. 158-170 - Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, V. Vinay:
Circuits on Cylinders. 171-182
Computational Biology
- Peter Damaschke:
Fast Perfect Phylogeny Haplotype Inference. 183-194 - Jens Gramm, Jiong Guo, Rolf Niedermeier:
On Exact and Approximation Algorithms for Distinguishing Substring Selection. 195-209 - Patricia A. Evans, Andrew D. Smith:
Complexity of Approximating Closest Substring Problems. 210-221
Computational Geometry
- Binhai Zhu:
On Lawson's Oriented Walk in Random Delaunay Triangulations. 222-233 - Mikael Hammar, Bengt J. Nilsson, Mia Persson:
Competitive Exploration of Rectilinear Polygons. 234-245 - Lyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack:
An Improved Approximation Algorithm for Computing Geometric Shortest Paths. 246-257 - Zheng Sun, John H. Reif:
Adaptive and Compact Discretization for Weighted Region Optimal Path Finding. 258-270 - John H. Reif, Zheng Sun:
On Boundaries of Highly Visible Spaces and Applications. 271-283
Computational Models and Complexity
- Gheorghe Paun:
Membrane Computing. 284-295 - Farid M. Ablayev, Aida Gainutdinova:
Classical Simulation Complexity of Quantum Machines. 296-302 - Luis Antunes, Lance Fortnow, N. V. Vinodchandran:
Using Depth to Capture Average-Case Complexity. 303-310
Structural Complexity
- Richard J. Lipton, Anastasios Viglas:
Non-uniform Depth of Polynomial Time and Space Simulations. 311-320 - Martin Kutrib:
Dimension- and Time-Hierarchies for Small Time Bounds. 321-332 - Philippe Moser:
Baire's Categories on Small Complexity Classes. 333-342
Formal Languages
- Jean Berstel, Luc Boasson, Olivier Carton, Bruno Petazzoni, Jean-Eric Pin:
Operations Preserving Recognizable Languages. 343-354 - Vesa Halava, Tero Harju, Hendrik Jan Hoogeboom, Michel Latteux:
Languages Defined by Generalized Equality Sets. 355-363 - Michele Bugliesi, Ambra Ceccato, Sabina Rossi:
Context-Sensitive Equivalences for Non-interference Based Protocol Analysis. 364-375 - Werner Kuich, Klaus W. Wagner:
On the Exponentiation of Languages. 376-386 - Christian Pech:
Kleene's Theorem for Weighted Tree-Automata. 387-399
Logic
- Till Tantau:
Weak Cardinality Theorems for First-Order Logic. 400-411 - Wan J. Fokkink, Rob J. van Glabbeek, Paulien de Wind:
Compositionality of Hennessy-Milner Logic through Structural Operational Semantics. 412-422 - Andrzej Szalas:
On a Logical Approach to Estimating Computational Complexity of Potentially Intractable Problems. 423-431
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-10-31 20:23 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
