Conferences in DBLP
Wolfgang Thomas On the Synthesis of Strategies in Infinite Games. [Citation Graph (0, 0)][DBLP ] Conf ] Guy Louchard Finding the Maximum with Linear Error Probabilities: A Sequential Analysis Approach. [Citation Graph (0, 0)][DBLP ] Conf ] David W. Juedes , Jack H. Lutz Completeness and Weak Completeness Under Polynomial-Size Circuits. [Citation Graph (0, 0)][DBLP ] Conf ] Jin-yi Cai , Richard J. Lipton , Luc Longpré , Mitsunori Ogihara , Kenneth W. Regan , D. Sivakumar Communication Complexity of Key Agreement on Small Ranges. [Citation Graph (0, 0)][DBLP ] Conf ] Yenjo Han , Lane A. Hemaspaandra Pseudorandom Generators and the Frequency of Simplicity. [Citation Graph (0, 0)][DBLP ] Conf ] Ulrich Hertrampf Classes of Bounded Counting Type and their Inclusion Relations. [Citation Graph (0, 0)][DBLP ] Conf ] Frederic Green Lower Bounds for Depth-Three Circuits With Equals and Mod-Gates. [Citation Graph (0, 0)][DBLP ] Conf ] Matthias Krause On Realizing Iterated Multiplication by Small Depth Threshold Circuits. [Citation Graph (0, 0)][DBLP ] Conf ] Bruno Durand A Random NP-Complete Problem for Inversion of 2D Cellular Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Isabelle Fagnot On the Subword Equivalence Problem for Infinite Words. [Citation Graph (0, 0)][DBLP ] Conf ] Emmanuelle Garel On the Separators on an Infinite Word Generated by a Morphism. [Citation Graph (0, 0)][DBLP ] Conf ] Angelo Monti , Adriano Peron Systolic Tree Omega-Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Sriram C. Krishnan , Anuj Puri , Robert K. Brayton Structural Complexity of Omega-Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Torsten Minkwitz Algorithms Explained by Symmetries. [Citation Graph (0, 0)][DBLP ] Conf ] Paul F. Fischer , Franco P. Preparata , John E. Savage Generalized Scans and Tri-Diagonal Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Maxime Crochemore , Leszek Gasieniec , Wojciech Plandowski , Wojciech Rytter Two-Dimensional Pattern Matching in Linear Time and Small Space. [Citation Graph (0, 0)][DBLP ] Conf ] Hristo Djidjev , Grammati E. Pantziou , Christos D. Zaroliagis On-line and Dynamic Algorithms for Shorted Path Problems. [Citation Graph (1, 0)][DBLP ] Conf ] Marco Cadoli , Francesco M. Donini , Marco Schaerf On Compact Representations of Propositional Circumscription. [Citation Graph (0, 0)][DBLP ] Conf ] Giovanna D'Agostino , Angelo Montanari , Alberto Policriti A Set-Theoretic Translation Method for (Poly)modal Logics. [Citation Graph (0, 0)][DBLP ] Conf ] Oded Maler , Amir Pnueli , Joseph Sifakis On the Synthesis of Discrete Controllers for Timed Systems (An Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Michele Boreale , Davide Sangiorgi A Fully Abstract Semantics for Causality in the Pi-Calculus. [Citation Graph (0, 0)][DBLP ] Conf ] Juraj Hromkovic , Krzysztof Lorys , Przemyslawa Kanarek , Ralf Klasing , Walter Unger , Hubert Wagener On the Sizes of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Friedhelm Meyer auf der Heide , Christian Scheideler , Volker Stemann Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations. [Citation Graph (0, 0)][DBLP ] Conf ] Michele Flammini , Giorgio Gambosi , Sandro Salomone Interval Routing Schemes. [Citation Graph (0, 0)][DBLP ] Conf ] Friedhelm Meyer auf der Heide , Berthold Vöcking A Packet Routing Protocol for Arbitrary Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Christiane Bercoff A Family of Tag Systems for Paperfolding Sequences. [Citation Graph (0, 0)][DBLP ] Conf ] Gerhard Buntrock , Friedrich Otto Growing Context-Sensitive Languages and Church-Rosser Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Dora Giammarresi , Rosa Montalbano Deterministic Generalized Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Piotr Indyk Optimal Simulation of Automata by Neural Nets. [Citation Graph (0, 0)][DBLP ] Conf ] Albert R. Meyer Concurrent Process Equivalences: Some Decision Problems (Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Pavol Duris , José D. P. Rolim Optimal Lower Bounds on the Multiparty Communication Complexity. [Citation Graph (0, 0)][DBLP ] Conf ] László Babai , Peter G. Kimmel , Satyanarayana V. Lokam Simultaneous Messages vs. Communication. [Citation Graph (0, 0)][DBLP ] Conf ] Véronique Bruyère , Clelia de Felice Coding and Strong Coding in Trace Monoids. [Citation Graph (0, 0)][DBLP ] Conf ] Volker Diekert , Anca Muscholl , Klaus Reinhardt On Codings of Traces. [Citation Graph (0, 0)][DBLP ] Conf ] Arvind Gupta , Naomi Nishimura Finding Largest Common Embeddable Subtrees. [Citation Graph (0, 0)][DBLP ] Conf ] Damon Kaller , Arvind Gupta , Thomas C. Shermer The Chi-t-Coloring Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Sotiris E. Nikoletseas , Paul G. Spirakis Expander Properties in Random Regular Graphs with Edge Faults. [Citation Graph (0, 0)][DBLP ] Conf ] Danièle Gardy , Guy Louchard Dynamic Analysis of the Sizes of Relations. [Citation Graph (0, 0)][DBLP ] Conf ] Danny Raz On Slender Context-free Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Valentin M. Antimirov Partial Derivates of Regular Expressions and Finite Automata Constructions. [Citation Graph (0, 0)][DBLP ] Conf ] Felipe Bracho , Manfred Droste , Dietrich Kuske Dependence Orders for Computations of Concurrent Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Anne-Cécile Fabret , Antoine Petit On the Undecidability of Deadlock Detection in Families of Nets. [Citation Graph (0, 0)][DBLP ] Conf ] Christine Rüb On the Average Running Time of Odd-Even Merge Sort. [Citation Graph (0, 0)][DBLP ] Conf ] Manfred Kunde , Rolf Niedermeier , Klaus Reinhardt , Peter Rossmanith Optimal Average Case Sorting on Arrays. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Strauss Normal Numbers and Sources for BPP. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas R. Hancock , Tao Jiang , Ming Li , John Tromp Lower Bounds on Learning Decision Lists and Trees (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Peter Damaschke Line Segmentation of Digital Curves in Parallel. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Kummer , Marcus Schäfer Computability of Convex Sets (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Thomas Ottmann , Sven Schuierer , Subbiah Soundaralakshmi Enumerating Extreme Points in Higher Dimensions. [Citation Graph (0, 0)][DBLP ] Conf ] Sylvain Petitjean The Number of Views of Piecewise-Smooth Algebraic Objects. [Citation Graph (0, 0)][DBLP ] Conf ] Ioan I. Macarie On the Structure of Log-Space Probabilistic Complexity Classes (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Lance Fortnow , Martin Kummer Resource-Bounded Instance Complexity (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Harry Buhrman , Montserrat Hermo On the Sparse Set Conjecture for Sets with Low Denisty. [Citation Graph (0, 0)][DBLP ] Conf ] Stephen A. Fenner , Lance Fortnow Beyond P^(NP) - NEXP. [Citation Graph (0, 0)][DBLP ] Conf ] Andreas Jakoby , Rüdiger Reischuk , Christian Schindelhauer Malign Distributions for Average Case Circuit Complexity. [Citation Graph (0, 0)][DBLP ] Conf ] Didier Arquès , Christian J. Michel A Prossible Code in the Genetic Code. [Citation Graph (0, 0)][DBLP ] Conf ] 