Conferences in DBLP
Micah Adler , John W. Byers , Richard M. Karp Scheduling Parallel Communication: The h-relation Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Stefan Arnborg Decomposable Structures, Boolean Function Representations, and Optimization. [Citation Graph (0, 0)][DBLP ] Conf ] Michele Flammini , Jan van Leeuwen , Alberto Marchetti-Spaccamela The Complexity of Interval Routing on Random Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Viliam Geffert Bridging Across the log(n) Space Frontier. [Citation Graph (0, 0)][DBLP ] Conf ] Georg Gottlob , Nicola Leone , Helmut Veith Second Order Logic and the Weak Exponential Hierarchies. [Citation Graph (1, 0)][DBLP ] Conf ] Juris Hartmanis On the Computing Paradigm and Computational Complexity. [Citation Graph (0, 0)][DBLP ] Conf ] Daniel J. Lehmann Ranked Structures in Nonmonotonic Reasoning and Belief Revision: Abstract. [Citation Graph (0, 0)][DBLP ] Conf ] Dominique Perrin Symbolic Dynamics and Finite Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Alexander A. Razborov Lower Bounds for Propositional Proofs and Independence Results in Bounded Arithmetic (Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Paul M. B. Vitányi Physics and the New Computation. [Citation Graph (0, 0)][DBLP ] Conf ] Eric Allender , Martin Strauss Measure on P: Robustness of the Notion. [Citation Graph (0, 0)][DBLP ] Conf ] Hans-Jörg Burtschick Comparing Counting Classes for Logspace, One-way Logspace, and First-order. [Citation Graph (0, 0)][DBLP ] Conf ] Carsten Damm , Markus Holzer Automata That Take Advice. [Citation Graph (0, 0)][DBLP ] Conf ] Steven Homer , Sarah Mocas Nonuniform Lower Bounds for Exponential Time Classes. [Citation Graph (0, 0)][DBLP ] Conf ] Susanne Kaufmann , Martin Kummer On a Quantitative Notion of Uniformity. [Citation Graph (0, 0)][DBLP ] Conf ] Wolfgang Merkle , Yongge Wang Separations by Random Oracles and "Almost" Classes for Generalized Reducibilities. [Citation Graph (0, 0)][DBLP ] Conf ] Danièle Beauquier , Dima Burago , Anatol Slissenko On the Complexity of Finite Memory Policies for Markov Decision Processes. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas Hofmeister , Hanno Lefmann Derandomization for Sparse Approximations and Independent Sets. [Citation Graph (0, 0)][DBLP ] Conf ] Jyrki Katajainen , Tomi Pasanen , George Titan Asymptotically Efficient In-Place Merging. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Heusch The Complexity of the Falsifiability Problem for Pure Implicational Formulas. [Citation Graph (0, 0)][DBLP ] Conf ] Viggo Kann Strong Lower Bounds on the Approximability of some NPO PB-Complete Maximization Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Hanno Lefmann , Petr Savický Some Typical Properties of Large AND/OR Boolean Formulas. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Hühne The Hedge: An Efficient Storage Device for Turing Machines with One Head (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Osamu Maruyama , Satoru Miyano Graph Inference from a Walk for TRees of Bounded Degree 3 is NP-Complete. [Citation Graph (0, 0)][DBLP ] Conf ] Ivan Stojmenovic Honecomb Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Sophie Fischer , Lane A. Hemaspaandra , Leen Torenvliet Witness-Isomorphic Reductions and the Local Search Problem (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Claudia Bertram-Kretzberg , Thomas Hofmeister Multiple Product Modulo Arbitrary Numbers. [Citation Graph (0, 0)][DBLP ] Conf ] Christoph Meinel , Stephan Waack Lower Bounds for the Majority Communication Complexity of Various Graph Accessibility Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Alberto Bertoni , Carlo Mereghetti , Giovanni Pighizzini Strong Optimal Lower Bounds for Turing Machines that Accept Nonregular Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Stanislav Zák A Superpolynomial Lower Bound for (1, +k(n))-Branching Programs. [Citation Graph (0, 0)][DBLP ] Conf ] Luca Breveglieri , Alessandra Cherubini , Stefano Crespi-Reghizzi Deterministic Parsing for Augmented Context-free Grammars. [Citation Graph (0, 0)][DBLP ] Conf ] Filippo Mignosi , Antonio Restivo , Sergio Salemi A Periodicity Theorem on Words and Applications. [Citation Graph (0, 0)][DBLP ] Conf ] Günter Hotz , Gisela Pitsch A New Approach to Analyse Coupled-Context-Free Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Miki Hermann , Phokion G. Kolaitis Computational Complexity of Simultaneous Elementary Matching Problems (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] M. R. K. Krishna Rao Graph Reducibility of Term Rewriting Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Pawel Urzyczyn Positive Recursive Type Assignment. [Citation Graph (0, 0)][DBLP ] Conf ] Evangelos Kranakis , Danny Krizanc , Flaminia L. Luccio String Recognition on Anonymous Rings. [Citation Graph (0, 0)][DBLP ] Conf ] Zsuzsanna Róka The Firing Squad Synchronization Problem on Cayley Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Jop F. Sibeyn , Michael Kaufmann Solving Cheap Graph Problems an Meshes. [Citation Graph (0, 0)][DBLP ] Conf ] Olaf Burkart , Didier Caucal , Bernhard Steffen An Elementary Bisimulation Decision Procedure for Arbitrary Context-Free Processes. [Citation Graph (0, 0)][DBLP ] Conf ] Serge Bauget , Paul Gastin On Congruences and Partial Orders. [Citation Graph (0, 0)][DBLP ] Conf ] Flavio Corradini , Roberto Gorrieri , Marco Roccetti Performance Preorder: Ordering Processes with Respect to Speed. [Citation Graph (0, 0)][DBLP ] Conf ] William Ferreira , Matthew Hennessy Towards a Semantic Theory of CML (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Sébastien Huguet , Antoine Petit Modular Constructions of Distributing Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Davide Sangiorgi On the Proof Method for Bisimulation (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Clare E. Martin Towards a Calculus of Predicate Transformers. [Citation Graph (0, 0)][DBLP ] Conf ] Martín Abadi , Stephan Merz An Abstract Account of Composition. [Citation Graph (0, 0)][DBLP ] Conf ] Roel van der Goot , Arie de Bruin Syntax and Semantics of Procol. [Citation Graph (0, 0)][DBLP ] Conf ] Jens Chr. Godskesen , Kim Guldstrand Larsen Synthesizing Distinguishing Formulae for Real Time Systems (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] François Laroussinie , Kim Guldstrand Larsen , Carsten Weise From Timed Automata to Logic - and Back. [Citation Graph (0, 0)][DBLP ] Conf ] Johann A. Makowsky , Elena V. Ravve Incremental Model Checking for Decomposable Structures (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] David Janin , Igor Walukiewicz Automata for the Modal mu-Calculus and related Results. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Niebert A v-Calculus with Local Views for Systems of Sequential Agents. [Citation Graph (0, 0)][DBLP ] Conf ] R. Feinsilver , René Schott An Operator Calculus Approach to the Evolution of Dynamic Data Structures. [Citation Graph (0, 0)][DBLP ] Conf ] 