Conferences in DBLP
Noam Nisan Algorithms for Selfish Agents. [Citation Graph (0, 0)][DBLP ] STACS, 1999, pp:1-15 [Conf ] Patrice Ossona de Mendez The Reduced Genus of a Multigraph. [Citation Graph (0, 0)][DBLP ] STACS, 1999, pp:16-31 [Conf ] Thomas Wilke Classifying Discrete Temporal Properties. [Citation Graph (0, 0)][DBLP ] STACS, 1999, pp:32-46 [Conf ] Anna Bernasconi , Igor Shparlinski Circuit Complexity of Testing Square-Free Numbers. [Citation Graph (0, 0)][DBLP ] STACS, 1999, pp:47-56 [Conf ] Martin Sauerhoff , Ingo Wegener , Ralph Werchner Relating Branching Program Size and Formula Size over the Full Binary Basis. [Citation Graph (0, 0)][DBLP ] STACS, 1999, pp:57-67 [Conf ] Alexander E. Andreev , Andrea E. F. Clementi , Paolo Penna , José D. P. Rolim Memory Organization Schemes for Large Shared Data: A Randomized Solution for Distributed Memory Machines. [Citation Graph (0, 0)][DBLP ] STACS, 1999, pp:68-77 [Conf ] Andreas Jakoby The Average Time Complexity to Compute Prefix Functions in Processor Networks. [Citation Graph (0, 0)][DBLP ] STACS, 1999, pp:78-89 [Conf ] Jin-yi Cai , Aduri Pavan , D. Sivakumar On the Hardness of Permanent. [Citation Graph (0, 0)][DBLP ] STACS, 1999, pp:90-99 [Conf ] Harry Buhrman , Lance Fortnow One-sided Versus Two-sided Error in Probabilistic Computation. [Citation Graph (0, 0)][DBLP ] STACS, 1999, pp:100-109 [Conf ] Christian Icking , Rolf Klein , Elmar Langetepe An Optimal Competitive Strategy for Walking in Streets. [Citation Graph (0, 0)][DBLP ] STACS, 1999, pp:110-120 [Conf ] Sven Schuierer , Ines Semrau An Optimal Strategy for Searching in Unknown Streets. [Citation Graph (0, 0)][DBLP ] STACS, 1999, pp:121-131 [Conf ] Mikael Hammar , Bengt J. Nilsson , Sven Schuierer Parallel Searching on m Rays. [Citation Graph (0, 0)][DBLP ] STACS, 1999, pp:132-142 [Conf ] Clemens Lautemann , Nicole Schweikardt , Thomas Schwentick A Logical Characterisation of Linear Time on Nondeterministic Turing Machines. [Citation Graph (0, 0)][DBLP ] STACS, 1999, pp:143-152 [Conf ] Bruno Durand , Alexander Shen , Nikolai K. Vereshchagin Descriptive Complexity of Computable Sequences. [Citation Graph (0, 0)][DBLP ] STACS, 1999, pp:153-162 [Conf ] Clifford Bergman , Giora Slutzki Complexity of Some Problems in Universal Algebra. [Citation Graph (0, 0)][DBLP ] STACS, 1999, pp:163-172 [Conf ] Ton Kloks , Jan Kratochvíl , Haiko Müller New Branchwidth Territories. [Citation Graph (0, 0)][DBLP ] STACS, 1999, pp:173-183 [Conf ] Ming-Yang Kao , Andrzej Lingas , Anna Östlin Balanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructions. [Citation Graph (0, 0)][DBLP ] STACS, 1999, pp:184-196 [Conf ] Vincent Bouchitté , Ioan Todinca Treewidth and Minimum Fill-in of Weakly Triangulated Graphs. [Citation Graph (0, 0)][DBLP ] STACS, 1999, pp:197-206 [Conf ] Vesa Halava , Mika Hirvensalo , Ronald de Wolf Decidability and Undecidability of Marked PCP. [Citation Graph (0, 0)][DBLP ] STACS, 1999, pp:207-216 [Conf ] John Michael Robson , Volker Diekert On Quadratic Word Equations. [Citation Graph (0, 0)][DBLP ] STACS, 1999, pp:217-226 [Conf ] Daniel Kirsten Some Undecidability Results Related to the Star Problem in Trace Monoids. [Citation Graph (0, 0)][DBLP ] STACS, 1999, pp:227-236 [Conf ] Gunnar Andersson An Approximation Algorithm for Max p-Section. [Citation Graph (0, 0)][DBLP ] STACS, 1999, pp:237-247 [Conf ] Dieter Kratsch , Lorna Stewart Approximating Bandwidth by Mixing Layouts of Interval Graphs. [Citation Graph (0, 0)][DBLP ] STACS, 1999, pp:248-258 [Conf ] Robert Preis Linear Time 1/2-Approximation Algorithm for Maximum Weighted Matching in General Graphs. [Citation Graph (0, 0)][DBLP ] STACS, 1999, pp:259-269 [Conf ] Edith Hemaspaandra , Lane A. Hemaspaandra , Harald Hempel Extending Downward Collapse from 1-versus-2 Queries to j-versus-j+1 Queries. [Citation Graph (0, 0)][DBLP ] STACS, 1999, pp:269-280 [Conf ] Vikraman Arvind , Jacobo Torán Sparse Sets, Approximable Sets, and Parallel Queries to NP. [Citation Graph (0, 0)][DBLP ] STACS, 1999, pp:281-290 [Conf ] Jop F. Sibeyn External Selection. [Citation Graph (0, 0)][DBLP ] STACS, 1999, pp:291-301 [Conf ] Timm Ahrendt Fast Computations of the Exponential Function. [Citation Graph (0, 0)][DBLP ] STACS, 1999, pp:302-312 [Conf ] Maciej Koutny , Giuseppe Pappalardo A Model of Behaviour Abstraction for Communicating Processes. [Citation Graph (0, 0)][DBLP ] STACS, 1999, pp:313-322 [Conf ] Ahmed Bouajjani , Richard Mayr Model Checking Lossy Vector Addition Systems. [Citation Graph (0, 0)][DBLP ] STACS, 1999, pp:323-333 [Conf ] Bang Ye Wu , Kun-Mao Chao , Chuan Yi Tang Constructing Light Spanning Trees with Small Routing Cost. [Citation Graph (0, 0)][DBLP ] STACS, 1999, pp:334-344 [Conf ] Matti Nykänen , Esko Ukkonen Finding Paths with the Right Cost. [Citation Graph (0, 0)][DBLP ] STACS, 1999, pp:345-355 [Conf ] Mario Szegedy In How Many Steps the k Peg Version of the Towers of Hanoi Game Can Be Solved? [Citation Graph (0, 0)][DBLP ] STACS, 1999, pp:356-361 [Conf ] Gudmund Skovbjerg Frandsen , Johan P. Hansen , Peter Bro Miltersen Lower Bounds for Dynamic Algebraic Problems. [Citation Graph (0, 0)][DBLP ] STACS, 1999, pp:362-372 [Conf ] Lars Engebretsen An Explicit Lower Bound for TSP with Distances One and Two. [Citation Graph (0, 0)][DBLP ] STACS, 1999, pp:373-382 [Conf ] Andreas Jakoby , Maciej Liskiewicz , Rüdiger Reischuk Scheduling Dynamic Graphs. [Citation Graph (0, 0)][DBLP ] STACS, 1999, pp:383-392 [Conf ] William Aiello , Costas Busch , Maurice Herlihy , Marios Mavronicolas , Nir Shavit , Dan Touitou Supporting Increment and Decrement Operations in Balancing Networks. [Citation Graph (0, 0)][DBLP ] STACS, 1999, pp:393-403 [Conf ] Elias Koutsoupias , Christos H. Papadimitriou Worst-case Equilibria. [Citation Graph (0, 0)][DBLP ] STACS, 1999, pp:404-413 [Conf ] Rüdiger Reischuk , Thomas Zeugmann A Complete and Tight Average-Case Analysis of Learning Monomials. [Citation Graph (0, 0)][DBLP ] STACS, 1999, pp:414-423 [Conf ] John Case , Keh-Jiann Chen , Sanjay Jain Costs of General Purpose Learning. [Citation Graph (0, 0)][DBLP ] STACS, 1999, pp:424-433 [Conf ] Rainer Schuler Universal Distributions and Time-Bounded Kolmogorov Complexity. [Citation Graph (0, 0)][DBLP ] STACS, 1999, pp:434-443 [Conf ] Clemens Lautemann , Pierre McKenzie , Thomas Schwentick , Heribert Vollmer The Descriptive Complexity Approach to LOGCFL. [Citation Graph (0, 0)][DBLP ] STACS, 1999, pp:444-454 [Conf ] Orna Kupferman , Moshe Y. Vardi The Weakness of Self-Complementation. [Citation Graph (0, 0)][DBLP ] STACS, 1999, pp:455-466 [Conf ] Thomas Eiter , Toshihide Ibaraki , Kazuhisa Makino On the Difference of Horn Theories. [Citation Graph (0, 0)][DBLP ] STACS, 1999, pp:467-477 [Conf ] Mark Ettinger , Peter Høyer On Quantum Algorithms for Noncommutative Hidden Subgroups. [Citation Graph (0, 0)][DBLP ] STACS, 1999, pp:478-487 [Conf ] Martin Sauerhoff On the Size of Randomized OBDDs and Read-Once Branching Programs for k-Stable Functions. [Citation Graph (0, 0)][DBLP ] STACS, 1999, pp:488-499 [Conf ] Giovanni Di Crescenzo , Niels Ferguson , Russell Impagliazzo , Markus Jakobsson How to Forget a Secret. [Citation Graph (0, 0)][DBLP ] STACS, 1999, pp:500-509 [Conf ] Markus Müller-Olm A Modal Fixpoint Logic with Chop. [Citation Graph (0, 0)][DBLP ] STACS, 1999, pp:510-520 [Conf ] Rana Barua , Suman Roy , Zhou Chaochen Completeness of Neighbourhood Logic. [Citation Graph (0, 0)][DBLP ] STACS, 1999, pp:521-530 [Conf ] Martin Otto Eliminating Recursion in the µ-Calculus. [Citation Graph (0, 0)][DBLP ] STACS, 1999, pp:531-540 [Conf ] Jochen Meßner On Optimal Algorithms and Optimal Proof Systems. [Citation Graph (0, 0)][DBLP ] STACS, 1999, pp:541-550 [Conf ] Juan Luis Esteban , Jacobo Torán Space Bounds for Resolution. [Citation Graph (0, 0)][DBLP ] STACS, 1999, pp:551-560 [Conf ] Rolf Niedermeier , Peter Rossmanith Upper Bounds for Vertex Cover Further Improved. [Citation Graph (0, 0)][DBLP ] STACS, 1999, pp:561-570 [Conf ] Marco Riedel Online Matching for Scheduling Problems. [Citation Graph (0, 0)][DBLP ] STACS, 1999, pp:571-580 [Conf ]