Conferences in DBLP
Andrzej Ehrenfeucht , Tero Harju , Grzegorz Rozenberg Theory of 2-Structures. [Citation Graph (0, 0)][DBLP ] Conf ] Volker Diekert , Paul Gastin A Domain for Concurrent Termination: A Generalization of Mazurkiewicz Traces (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Zoltán Ésik , Michael Bertol Nonfinite Axiomatizability of the Equational Theory of Shuffle. [Citation Graph (0, 0)][DBLP ] Conf ] Werner Kuich The Algebraic Equivalent of AFL Theory. [Citation Graph (0, 0)][DBLP ] Conf ] Karel Culik II , Jarkko Kari Finite State Transformations of Images. [Citation Graph (0, 0)][DBLP ] Conf ] Marjo Lipponen Post Correspondence Problem: Words Possible as Primitive Solutions. [Citation Graph (0, 0)][DBLP ] Conf ] Yves Métivier , Gwénaël Richomme , Pierre-André Wacrenier Computing the Closure of Sets of Words Under Partial Commutations. [Citation Graph (0, 0)][DBLP ] Conf ] Hans L. Bodlaender , Babette de Fluiter Intervalizing k-Colored Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Zhi-Zhong Chen NC Algorithms for Finding a Maximal Set of Paths with Application to Compressing Strings. [Citation Graph (0, 0)][DBLP ] Conf ] Raffaele Giancarlo , Roberto Grossi On the Construction of Classes of Suffix Trees for Square Matrices: Algorithms and Applications. [Citation Graph (0, 0)][DBLP ] Conf ] Andreas Parra , Petra Scheffler How to Use the Minimal Separators of a Graph for its Chordal Triangulation. [Citation Graph (0, 0)][DBLP ] Conf ] Jean-Claude Bermond , Luisa Gargano , Adele A. Rescigno , Ugo Vaccaro Fast Gossiping by Short Messages. [Citation Graph (0, 0)][DBLP ] Conf ] Feng Bao , Yoshihide Igarashi Break Finite Automata Public Key Cryptosystem. [Citation Graph (0, 0)][DBLP ] Conf ] Sotiris E. Nikoletseas , John H. Reif , Paul G. Spirakis , Moti Yung Stocastic Graphs Have Short Memory: Fully Dynamic Connectivity in Poly-Log Expected Time. [Citation Graph (0, 0)][DBLP ] Conf ] Carlo Blundo , Alfredo De Santis , Giuseppe Persiano , Ugo Vaccaro On the Number of Random Bits in Totally Private Computation. [Citation Graph (0, 0)][DBLP ] Conf ] Rusins Freivalds , Marek Karpinski Lower Time Bounds for Randomized Computation. [Citation Graph (0, 0)][DBLP ] Conf ] Johannes Köbler , Osamu Watanabe New Collapse Consequences of NP Having Small Circuits. [Citation Graph (0, 0)][DBLP ] Conf ] José L. Balcázar The Complexity of Searching Succinctly Represented Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Frank Bauernöppel , Evangelos Kranakis , Danny Krizanc , Anil Maheshwari , Marc Noy , Jörg-Rüdiger Sack , Jorge Urrutia Optimal Shooting: Characterizations and Applications. [Citation Graph (0, 0)][DBLP ] Conf ] Vincenzo Auletta , Domenico Parente , Giuseppe Persiano Placing Resources in a Tree: Dynamic and Static Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Shiva Chaudhuri , Christos D. Zaroliagis Shortest Path Queries in Digraphs of Small Treewidth. [Citation Graph (1, 0)][DBLP ] Conf ] Mordecai J. Golin , Günter Rote A Dynamic Programming Algorithm for Constructing Optimal Refix-Free Codes for Unequal Letter Costs. [Citation Graph (0, 0)][DBLP ] Conf ] Hans L. Bodlaender , Torben Hagerup Parallel Algorithms with Optimal Speedup for Bounded Treewidth. [Citation Graph (0, 0)][DBLP ] Conf ] Monika Rauch Henzinger Approximating Minimum Cuts under Insertions. [Citation Graph (0, 0)][DBLP ] Conf ] Derek G. Corneil , Stephan Olariu , Lorna Stewart Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Stefano Leonardi , Alberto Marchetti-Spaccamela On-line Resource Management with Applications to Routing and Scheduling. [Citation Graph (0, 0)][DBLP ] Conf ] H. Petersen Alternation in Simple Devices. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas A. Henzinger Hybrid Automata with Finite Bisimulatioins. [Citation Graph (0, 0)][DBLP ] Conf ] Luis-Miguel Lopez , Philippe Narbel Generalized Sturmian Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Jean-Eric Pin , Pascal Weil Polynomial Closure and Unambiguous Product. [Citation Graph (0, 0)][DBLP ] Conf ] Amir M. Ben-Amram , Zvi Galil Lower Bounds on Algebraic Random Access Machines (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Andrea Pietracaprina , Geppino Pucci Improved Deterministic PRAM Simulation on the Mesh. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus Ambos-Spies On Optimal Polynomial Time Approximations: P-Levelability vs. Delta-Levelability (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Stephen A. Fenner , Jack H. Lutz , Elvira Mayordomo Weakly Useful Sequences. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas Schwentick Graph Connectivity, Monadic NP and Built-in Relations of Moderate Degree. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas A. Henzinger , Peter W. Kopke , Howard Wong-Toi The Expressive Power of Clocks. [Citation Graph (0, 0)][DBLP ] Conf ] Gheorghe Paun Grammar Systems: A Grammatical Approach to Distribution and Cooperation. [Citation Graph (0, 0)][DBLP ] Conf ] Tero Harju , Juhani Karhumäki , Wojciech Plandowski Compactness of Systems of Equations in Semigroups. [Citation Graph (0, 0)][DBLP ] Conf ] Pavol Duris , Zvi Galil Sensing Versus Nonsensing Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Panayiotis Bozanis , Nectarios Kitsios , Christos Makris , Athanasios K. Tsakalidis New Upper Bounds for Generalized Intersection Searching Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Bernd Becker , Rolf Drechsler , Michael Theobald OKFDDs versus OBDDs and OFDDs. [Citation Graph (0, 0)][DBLP ] Conf ] Madhav V. Marathe , R. Ravi , Ravi Sundaram , S. S. Ravi , Daniel J. Rosenkrantz , Harry B. Hunt III Bicriteria Network Design Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Ngoc-Minh Lê On Determining Optimal Strategies in Pursiut Games in the Plane. [Citation Graph (0, 0)][DBLP ] Conf ] Albert Rubio Extension Orderings. [Citation Graph (0, 0)][DBLP ] Conf ] Sergio Greco , Domenico Saccà , Carlo Zaniolo The PushDown Method to Optimize Chain Logic Programs (Extended Abstract). [Citation Graph (1, 0)][DBLP ] Conf ] Jørgen H. Andersen , Kåre J. Kristoffersen , Kim Guldstrand Larsen , Jesper Niedermann Automatic Synthesis of Real Time Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Manuel Blum , Bruno Codenotti , Peter Gemmell , Troy Shahoumian Self-Correcting for Function Fields Transcendental Degree. [Citation Graph (0, 0)][DBLP ] Conf ] Lance Fortnow , Rusins Freivalds , William I. Gasarch , Martin Kummer , Stuart A. Kurtz , Carl H. Smith , Frank Stephan Measure, Category and Learning Theory. [Citation Graph (0, 0)][DBLP ] Conf ] Michel Cosnard , Eric Goles Ch. A Characterization of the Existence of Energies for Neural Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Helmut Jürgensen , Stavros Konstantinidis Variable-Length Codes for Error Correction. [Citation Graph (0, 0)][DBLP ] Conf ] Samir Khuller , Ehud Rivlin , Azriel Rosenfeld Graphbots: Mobility in Discrete Spaces. [Citation Graph (0, 0)][DBLP ] Conf ] Eike Best , Maciej Koutny Solving Recursive Net Equations. [Citation Graph (0, 0)][DBLP ] Conf ] Anuj Dawar , Lauri Hella , Phokion G. Kolaitis Implicit Definability and Infinitary Logic in Finite Model Theory. [Citation Graph (0, 0)][DBLP ] Conf ] Walter Vogler The Limit of Split_n-Language Equivalence. [Citation Graph (0, 0)][DBLP ] Conf ] V. Natarajan , Rance Cleaveland Divergence and Fair Testing. [Citation Graph (0, 0)][DBLP ] Conf ] Pierpaolo Degano , Corrado Priami Causality for Mobile Processes. [Citation Graph (0, 0)][DBLP ] Conf ] Davide Sangiorgi Internal Mobility and Agent-Passing Calculi. [Citation Graph (0, 0)][DBLP ] Conf ] 