Conferences in DBLP
Claire Kenyon Approximation Schemes for Metric Clustering Problems. [Citation Graph (0, 0)][DBLP ] STACS, 2004, pp:1-3 [Conf ] Erich Grädel Positional Determinacy of Infinite Games. [Citation Graph (0, 0)][DBLP ] STACS, 2004, pp:4-18 [Conf ] Harry Buhrman , Hartmut Klauck , Nikolai K. Vereshchagin , Paul M. B. Vitányi Individual Communication Complexity: Extended Abstract. [Citation Graph (0, 0)][DBLP ] STACS, 2004, pp:19-30 [Conf ] Bernhard Schwarz The Complexity of Satisfiability Problems over Finite Lattices. [Citation Graph (0, 0)][DBLP ] STACS, 2004, pp:31-43 [Conf ] Kristoffer Arnsfelt Hansen Constant Width Planar Computation Characterizes ACC^{0} . [Citation Graph (0, 0)][DBLP ] STACS, 2004, pp:44-55 [Conf ] Fedor V. Fomin , Dimitrios M. Thilikos A Simple and Fast Approach for Solving Problems on Planar Graphs. [Citation Graph (0, 0)][DBLP ] STACS, 2004, pp:56-67 [Conf ] Annamária Kovács Sum-Multicoloring on Paths. [Citation Graph (0, 0)][DBLP ] STACS, 2004, pp:68-80 [Conf ] Holger Bast , Kurt Mehlhorn , Guido Schäfer , Hisao Tamaki Matching Algorithms Are Fast in Sparse Random Graphs. [Citation Graph (0, 0)][DBLP ] STACS, 2004, pp:81-92 [Conf ] Andris Ambainis , Martin Beaudry , Marats Golovkins , Arnolds Kikusts , Mark Mercer , Denis Thérien Algebraic Results on Quantum Automata. [Citation Graph (0, 0)][DBLP ] STACS, 2004, pp:93-104 [Conf ] Andris Ambainis , Kazuo Iwama , Akinori Kawachi , Hiroyuki Masuda , Raymond H. Putra , Shigeru Yamashita Quantum Identification of Boolean Oracles. [Citation Graph (0, 0)][DBLP ] STACS, 2004, pp:105-116 [Conf ] Alberto Bertoni , Christian Choffrut , Massimiliano Goldwurm , Violetta Lonati Local Limit Distributions in Pattern Statistics: Beyond the Markovian Models. [Citation Graph (0, 0)][DBLP ] STACS, 2004, pp:117-128 [Conf ] Daniel Reidenbach A Discontinuity in Pattern Inference. [Citation Graph (0, 0)][DBLP ] STACS, 2004, pp:129-140 [Conf ] Evgeny Dantsin , Edward A. Hirsch , Alexander Wolpert Algorithms for SAT Based on Search in Hamming Balls. [Citation Graph (0, 0)][DBLP ] STACS, 2004, pp:141-151 [Conf ] David A. Cohen , Martin C. Cooper , Peter Jeavons , Andrei A. Krokhin Identifying Efficiently Solvable Cases of Max CSP. [Citation Graph (0, 0)][DBLP ] STACS, 2004, pp:152-163 [Conf ] Elmar Böhler , Edith Hemaspaandra , Steffen Reith , Heribert Vollmer The Complexity of Boolean Constraint Isomorphism. [Citation Graph (0, 0)][DBLP ] STACS, 2004, pp:164-175 [Conf ] Stavros G. Kolliopoulos , George Steiner On Minimizing the Total Weighted Tardiness on a Single Machine. [Citation Graph (0, 0)][DBLP ] STACS, 2004, pp:176-186 [Conf ] Yair Bartal , Francis Y. L. Chin , Marek Chrobak , Stanley P. Y. Fung , Wojciech Jawor , Ron Lavi , Jiri Sgall , Tomás Tichý Online Competitive Algorithms for Maximizing Weighted Throughput of Unit Jobs. [Citation Graph (0, 0)][DBLP ] STACS, 2004, pp:187-198 [Conf ] Tomás Ebenlendr , Jiri Sgall Optimal and Online Preemptive Scheduling on Uniformly Related Machines. [Citation Graph (0, 0)][DBLP ] STACS, 2004, pp:199-210 [Conf ] Christoph Ambühl , Birgitta Weber Parallel Prefetching and Caching Is Hard. [Citation Graph (0, 0)][DBLP ] STACS, 2004, pp:211-221 [Conf ] Telikepalli Kavitha , Kurt Mehlhorn , Dimitrios Michail , Katarzyna E. Paluch Strongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents Problem. [Citation Graph (0, 0)][DBLP ] STACS, 2004, pp:222-233 [Conf ] Kedar Dhamdhere , Anupam Gupta , R. Ravi Approximation Algorithms for Minimizing Average Distortion. [Citation Graph (0, 0)][DBLP ] STACS, 2004, pp:234-245 [Conf ] Pierre Fraigniaud , David Ilcinkas Digraphs Exploration with Little Memory. [Citation Graph (0, 0)][DBLP ] STACS, 2004, pp:246-257 [Conf ] Ioannis Caragiannis , Christos Kaklamanis Approximate Path Coloring with Applications to Wavelength Assignment in WDM Optical Networks. [Citation Graph (0, 0)][DBLP ] STACS, 2004, pp:258-269 [Conf ] Thomas Erlebach , Riko Jacob , Matús Mihalák , Marc Nunkesser , Gábor Szabó , Peter Widmayer An Algorithmic View on OVSF Code Assignment. [Citation Graph (0, 0)][DBLP ] STACS, 2004, pp:270-281 [Conf ] Marie-Pierre Béal , Francesca Fiorenzi , Dominique Perrin The Syntactic Graph of a Sofic Shift. [Citation Graph (0, 0)][DBLP ] STACS, 2004, pp:282-293 [Conf ] Tero Harju , Dirk Nowotka Periodicity and Unbordered Words: A Proof of Duval?s Conjecture. [Citation Graph (0, 0)][DBLP ] STACS, 2004, pp:294-304 [Conf ] Daniel Kirsten Desert Automata and the Finite Substitution Problem. [Citation Graph (0, 0)][DBLP ] STACS, 2004, pp:305-316 [Conf ] Jan Johannsen Satisfiability Problems Complete for Deterministic Logarithmic Space. [Citation Graph (0, 0)][DBLP ] STACS, 2004, pp:317-325 [Conf ] Till Tantau A Logspace Approximation Scheme for the Shortest Path Problem for Graphs with Bounded Independence Number. [Citation Graph (0, 0)][DBLP ] STACS, 2004, pp:326-337 [Conf ] Régis Barbanchon , Etienne Grandjean The Minimal Logically-Defined NP-Complete Problem. [Citation Graph (0, 0)][DBLP ] STACS, 2004, pp:338-349 [Conf ] Torsten Tholey Solving the 2-Disjoint Paths Problem in Nearly Linear Time. [Citation Graph (0, 0)][DBLP ] STACS, 2004, pp:350-361 [Conf ] Torben Hagerup Simpler Computation of Single-Source Shortest Paths in Linear Average Time. [Citation Graph (0, 0)][DBLP ] STACS, 2004, pp:362-369 [Conf ] Mårten Trolin Lattices with Many Cycles Are Dense. [Citation Graph (0, 0)][DBLP ] STACS, 2004, pp:370-381 [Conf ] Ralf Küsters , Thomas Wilke Automata-Based Analysis of Recursive Cryptographic Protocols. [Citation Graph (0, 0)][DBLP ] STACS, 2004, pp:382-393 [Conf ] Murali K. Ganapathy , Sachin Lodha On Minimum Circular Arrangement. [Citation Graph (0, 0)][DBLP ] STACS, 2004, pp:394-405 [Conf ] Aubin Jarry Integral Symmetric 2-Commodity Flows. [Citation Graph (0, 0)][DBLP ] STACS, 2004, pp:406-417 [Conf ] Christoph Ambühl , Andrea E. F. Clementi , Miriam Di Ianni , Nissan Lev-Tov , Angelo Monti , David Peleg , Gianluca Rossi , Riccardo Silvestri Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks. [Citation Graph (0, 0)][DBLP ] STACS, 2004, pp:418-427 [Conf ] Thomas Colcombet , Christof Löding On the Expressiveness of Deterministic Transducers over Infinite Trees. [Citation Graph (0, 0)][DBLP ] STACS, 2004, pp:428-439 [Conf ] Bakhadyr Khoussainov , Sasha Rubin , Frank Stephan Definability and Regularity in Automatic Structures. [Citation Graph (0, 0)][DBLP ] STACS, 2004, pp:440-451 [Conf ] Anca Muscholl , Thomas Schwentick , Luc Segoufin Active Context-Free Games. [Citation Graph (0, 0)][DBLP ] STACS, 2004, pp:452-464 [Conf ] Anna Palbom Worst Case Performance of an Approximation Algorithm for Asymmetric TSP. [Citation Graph (0, 0)][DBLP ] STACS, 2004, pp:465-476 [Conf ] Huaming Zhang , Xin He On Visibility Representation of Plane Graphs. [Citation Graph (0, 0)][DBLP ] STACS, 2004, pp:477-488 [Conf ] Guido Schäfer , Naveen Sivadasan Topology Matters: Smoothed Competitiveness of Metrical Task Systems. [Citation Graph (0, 0)][DBLP ] STACS, 2004, pp:489-500 [Conf ] Eduardo Sany Laber A Randomized Competitive Algorithm for Evaluating Priced AND/OR Trees. [Citation Graph (0, 0)][DBLP ] STACS, 2004, pp:501-512 [Conf ] Martin Aigner , Gianluca De Marco , Manuela Montangero The Plurality Problem with Three Colors. [Citation Graph (0, 0)][DBLP ] STACS, 2004, pp:513-521 [Conf ] Doron Bustan , Orna Kupferman , Moshe Y. Vardi A Measured Collapse of the Modal µ-Calculus Alternation Hierarchy. [Citation Graph (0, 0)][DBLP ] STACS, 2004, pp:522-533 [Conf ] Carlos Brito , Eli Gafni , Shailesh Vaya An Information Theoretic Lower Bound for Broadcasting in Radio Networks. [Citation Graph (0, 0)][DBLP ] STACS, 2004, pp:534-546 [Conf ] Thomas Lücking , Marios Mavronicolas , Burkhard Monien , Manuel Rode A New Model for Selfish Routing. [Citation Graph (0, 0)][DBLP ] STACS, 2004, pp:547-558 [Conf ] Philippe Duchon , Nicolas Hanusse , Nasser Saheb , Akka Zemmari Broadcast in the Rendezvous Model. [Citation Graph (0, 0)][DBLP ] STACS, 2004, pp:559-570 [Conf ] Jin-yi Cai , Venkatesan T. Chakaravarthy , Dieter van Melkebeek Time-Space Tradeoff in Derandomizing Probabilistic Logspace. [Citation Graph (0, 0)][DBLP ] STACS, 2004, pp:571-583 [Conf ] Eric Allender , Harry Buhrman , Michal Koucký What Can be Efficiently Reduced to the K-Random Strings? [Citation Graph (0, 0)][DBLP ] STACS, 2004, pp:584-595 [Conf ] Sebastian Bala Regular Language Matching and Other Decidable Cases of the Satisfiability Problem for Constraints between Regular Open Terms. [Citation Graph (0, 0)][DBLP ] STACS, 2004, pp:596-607 [Conf ] Vincenzo Auletta , Roberto De Prisco , Paolo Penna , Giuseppe Persiano Deterministic Truthful Approximation Mechanisms for Scheduling Related Machines. [Citation Graph (0, 0)][DBLP ] STACS, 2004, pp:608-619 [Conf ] Alexander Souza , Angelika Steger The Expected Competitive Ratio for Weighted Completion Time Scheduling. [Citation Graph (0, 0)][DBLP ] STACS, 2004, pp:620-631 [Conf ] Krishna B. Athreya , John M. Hitchcock , Jack H. Lutz , Elvira Mayordomo Effective Strong Dimension in Algorithmic Information and Computational Complexity. [Citation Graph (0, 0)][DBLP ] STACS, 2004, pp:632-643 [Conf ] Andrew V. Goldberg , Jason D. Hartline , Anna R. Karlin , Michael E. Saks A Lower Bound on the Competitive Ratio of Truthful Auctions. [Citation Graph (0, 0)][DBLP ] STACS, 2004, pp:644-655 [Conf ] Marek Chrobak , Jiri Sgall Errata to Analysis of the Harmonic Algorithm for Three Servers. [Citation Graph (0, 0)][DBLP ] STACS, 2004, pp:656- [Conf ]