Conferences in DBLP
Dana S. Scott A New Category for Semantics. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Bürgisser On Implications between P-NP-Hypotheses: Decision versus Computation in Algebraic Complexity. [Citation Graph (0, 0)][DBLP ] Conf ] Erik D. Demaine Playing Games with Algorithms: Algorithmic Combinatorial Game Theory. [Citation Graph (0, 0)][DBLP ] Conf ] Amos Fiat Some Recent Results on Data Mining and Search. [Citation Graph (0, 0)][DBLP ] Conf ] Georg Gottlob , Nicola Leone , Francesco Scarcello Hypertree Decompositions: A Survey. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Hofmann The Strength of Non-size-increasing Computation (Introduction and Summary). [Citation Graph (0, 0)][DBLP ] Conf ] Peter Høyer Introduction to Recent Quantum Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Dana Randall Decomposition Methods and Sampling Circuits in the Cartesian Lattice. [Citation Graph (0, 0)][DBLP ] Conf ] Uwe Schöning New Algorithms for k -SAT Based on the Local Search Principle. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas Wilke Linear Temporal Logic and Finite Semigroups. [Citation Graph (0, 0)][DBLP ] Conf ] Jochen Alber , Hongbing Fan , Michael R. Fellows , Henning Fernau , Rolf Niedermeier , Frances A. Rosamond , Ulrike Stege Refined Search Tree Technique for DOMINATING SET on Planar Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Kazuyuki Amano , Tsukuru Hirosawa , Yusuke Watanabe , Akira Maruoka The Computational Power of a Family of Decision Forests. [Citation Graph (0, 0)][DBLP ] Conf ] Andris Ambainis , Arnolds Kikusts Exact Results for Accepting Probabilities of Quantum Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Albert Atserias Improved Bounds on the Weak Pigeonhole Principle and Infinitely Many Primes from Weaker Axioms. [Citation Graph (0, 0)][DBLP ] Conf ] Christopher L. Barrett , Harry B. Hunt III , Madhav V. Marathe , S. S. Ravi , Daniel J. Rosenkrantz , Richard Edwin Stearns Analysis Problems for Sequential Dynamical Systems and Communicating State Machines. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Beaudry , Markus Holzer The Complexity of Tensor Circuit Evaluation. [Citation Graph (0, 0)][DBLP ] Conf ] Markus Bläser Computing Reciprocals of Bivariate Power Series. [Citation Graph (0, 0)][DBLP ] Conf ] Ahmed Bouajjani , Peter Habermehl , Richard Mayr Automatic Verification of Recursive Procedures with One Integer Parameter. [Citation Graph (0, 0)][DBLP ] Conf ] Henrik Brosenne , Matthias Homeister , Stephan Waack Graph-Driven Free Parity BDDs: Algorithms and Lower Bounds. [Citation Graph (0, 0)][DBLP ] Conf ] Vasco Brattka Computable Versions of Baire's Category Theorem. [Citation Graph (0, 0)][DBLP ] Conf ] Véronique Bruyère , Olivier Carton Automata on Linear Orderings. [Citation Graph (0, 0)][DBLP ] Conf ] Julien Cervelle , Bruno Durand , Enrico Formenti Algorithmic Information Theory and Cellular Automata Dynamics. [Citation Graph (0, 0)][DBLP ] Conf ] Marek Chrobak , Lawrence L. Larmore , Wojciech Rytter The k-Median Problem for Directed Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Mary Cryan , Peter Bro Miltersen On Pseudorandom Generators in NC. [Citation Graph (0, 0)][DBLP ] Conf ] Felipe Cucker , Dima Grigoriev There Are No Sparse NPW -Hard Sets. [Citation Graph (0, 0)][DBLP ] Conf ] Giovanni Di Crescenzo Sharing One Secret vs. Sharing Many Secrets: Tight Bounds for the Max Improvement Ratio. [Citation Graph (0, 0)][DBLP ] Conf ] Josep Díaz , Maria J. Serna , Dimitrios M. Thilikos (H, C, K)-Coloring: Fast, Easy, and Hard Cases. [Citation Graph (0, 0)][DBLP ] Conf ] Rodney G. Downey , Denis R. Hirschfeldt , Geoffrey LaForte Randomness and Reducibility. [Citation Graph (0, 0)][DBLP ] Conf ] Pavol Duris , Ján Manuch On the Computational Complexity of Infinite Words. [Citation Graph (0, 0)][DBLP ] Conf ] Leah Epstein , Rob van Stee Lower Bounds for On-Line Single-Machine Scheduling. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas Erlebach Approximation Algorithms and Complexity Results for Path Problems in Trees of Rings. [Citation Graph (0, 0)][DBLP ] Conf ] Wolfgang Espelage , Egon Wanke A 3-Approximation Algorithm for Movement Minimization in Conveyor Flow Shop Processing. [Citation Graph (0, 0)][DBLP ] Conf ] Hervé Fournier Quantifier Rank for Parity of Embedded Finite Models. [Citation Graph (0, 0)][DBLP ] Conf ] Viliam Geffert Space Hierarchy Theorem Revised. [Citation Graph (0, 0)][DBLP ] Conf ] Viliam Geffert , Carlo Mereghetti , Giovanni Pighizzini Converting Two-Way Nondeterministic Unary Automata into Simpler Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Thanh Minh Hoang , Thomas Thierauf The Complexity of the Minimal Polynomial. [Citation Graph (0, 0)][DBLP ] Conf ] Galina Jirásková Note on Minimal Finite Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Jarkko Kari Synchronizing Finite Automata on Eulerian Digraphs. [Citation Graph (0, 0)][DBLP ] Conf ] Andreas Klein , Martin Kutrib A Time Hierarchy for Bounded One-Way Cellular Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Bartek Klin , Piotr Hoffman , Andrzej Tarlecki , Lutz Schröder , Till Mossakowski Checking Amalgamability Conditions for C ASL Architectural Specifications. [Citation Graph (0, 0)][DBLP ] Conf ] Chiu-Yuen Koo , Tak Wah Lam , Tsuen-Wan Ngan , Kar-Keung To On-Line Scheduling with Tight Deadlines. [Citation Graph (0, 0)][DBLP ] Conf ] Daniel Král , Jan Kratochvíl , Heinz-Jürgen Voss Complexity Note on Mixed Hypergraphs. [Citation Graph (0, 0)][DBLP ] Conf ] Sven Oliver Krumke , Willem de Paepe , Diana Poensgen , Leen Stougie News from the Online Traveling Repairman. [Citation Graph (0, 0)][DBLP ] Conf ] Markus Lohrey Word Problems for 2-Homogeneous Monoids and Symmetric Logspace. [Citation Graph (0, 0)][DBLP ] Conf ] Filippo Mignosi , Jeffrey Shallit , Ming-wei Wang Variations on a Theorem of Fine & Wilf. [Citation Graph (0, 0)][DBLP ] Conf ] Burkhard Monien , Robert Preis Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Cristopher Moore , Pascal Tesson , Denis Thérien Satisfiability of Systems of Equations over Finite Monoids. [Citation Graph (0, 0)][DBLP ] Conf ] Christophe Morvan , Colin Stirling Rational Graphs Trace Context-Sensitive Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Frank Neven , Thomas Schwentick , Victor Vianu Towards Regular Languages over Infinite Alphabets. [Citation Graph (0, 0)][DBLP ] Conf ] Arfst Nickelsen Partial Information and Special Case Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Mitsunori Ogihara , Seinosuke Toda The Complexity of Computing the Number of Self-Avoiding Walks in Two-Dimensional Grid Graphs and in Hypercube Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Nir Piterman , Moshe Y. Vardi From Bidirectionality to Alternation. [Citation Graph (0, 0)][DBLP ] Conf ] Libor Polák Syntactic Semiring of a Language. [Citation Graph (0, 0)][DBLP ] Conf ] Pavel Pudlák On Reducibility and Symmetry of Disjoint NP-Pairs. [Citation Graph (0, 0)][DBLP ] Conf ] Robert Rettinger , Xizhong Zheng Hierarchy of Monotonically Computable Real Numbers. [Citation Graph (0, 0)][DBLP ] Conf ] Luigi Santocanale On the Equational Definition of the Least Prefixed Point. [Citation Graph (0, 0)][DBLP ] Conf ] Arseny M. Shur , Yulia V. Konovalova On the Periods of Partial Words. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus Sutner The Size of Power Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Thimm On the Approximability of the Steiner Tree Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Zhuozhi Wang , Kaizhong Zhang Alignment between Two RNA Structures. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus Wich Characterization of Context-Free Languages with Polynomially Bounded Ambiguity. [Citation Graph (0, 0)][DBLP ] Conf ] 