Conferences in DBLP
Habib Abdulrab , Jean-Pierre Pécuchet On Word Equations and Makanin's Algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] Carme Àlvarez , Josep Díaz , Jacobo Torán Complexity Classes with Complete Problems Between P and NP-C. [Citation Graph (0, 0)][DBLP ] Conf ] Miklós Bartha Interpretations of Synchronous Flowchart Schemes. [Citation Graph (0, 0)][DBLP ] Conf ] Alberto Bertoni , Danilo Bruschi , Deborah Joseph , Meera Sitharam , Paul Young Generalized Boolean Hierarchies and Boolean Hierarchies Over RP (Conference Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Stephen L. Bloom The Equational Logic of Iterative Processes. [Citation Graph (0, 0)][DBLP ] Conf ] Hans L. Bodlaender , Shlomo Moran , Manfred K. Warmuth The Distributed Bit Complexity of the Ring: From the Anonymous to the Non-anonymous Case. [Citation Graph (0, 0)][DBLP ] Conf ] Andreas Brandstädt The Jump Number Problem for Biconvex Graphs and Rectangle Covers of Rectangular Regions. [Citation Graph (0, 0)][DBLP ] Conf ] Janusz A. Brzozowski , Jo C. Ebergen Recent Developments in the Design of Asynchronous Circuits. [Citation Graph (0, 0)][DBLP ] Conf ] Bogdan S. Chlebus , Krzysztof Diks , Torben Hagerup , Tomasz Radzik New Simulations between CRCW PRAMs. [Citation Graph (0, 0)][DBLP ] Conf ] Jean-Luc Coquidé , Max Dauchet , Sophie Tison About Connections Between Syntactical and Computational Complexity. [Citation Graph (0, 0)][DBLP ] Conf ] Pierluigi Crescenzi , Alessandro Panconesi Completeness in Approximation Classes. [Citation Graph (0, 0)][DBLP ] Conf ] Carsten Damm , Christoph Meinel Separating Completely Complexity Classes Related to Polynomial Size Omega-Decision Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Pál Dömösi , Zoltán Ésik , Balázs Imreh On Product Hierarchies of Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Pavol Duris , Pavel Pudlák On the Communication Complexity of Planarity. [Citation Graph (0, 0)][DBLP ] Conf ] Joost Engelfriet Context-Free NCE Graph Grammars. [Citation Graph (0, 0)][DBLP ] Conf ] Jean Françon , B. Randrianarimanana , René Schott Dynamic Data Structures with Finite Population: A Combinatorial Analysis. [Citation Graph (0, 0)][DBLP ] Conf ] Zoltán Fülöp , Sándor Vágvölgyi Iterated Deterministic Top-Down Look-Ahead. [Citation Graph (0, 0)][DBLP ] Conf ] Dominique Geniet , Loÿs Thimonier Using Generating Functions to Compute Concurrency. [Citation Graph (0, 0)][DBLP ] Conf ] Ana Gil-Luezas A Logic for Nondeterministic Functional Programs (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Bernd Graw Decision Problems and Coxeter Groups. [Citation Graph (0, 0)][DBLP ] Conf ] Erich Grädel Complexity of Formula Classes in First Order Logic with Functions. [Citation Graph (0, 0)][DBLP ] Conf ] Rodney R. Howell , Louis E. Rosier , Hsu-Chun Yen Normal and Sinkless Petri Nets. [Citation Graph (0, 0)][DBLP ] Conf ] Neil Immerman Descriptive and Computational Complexity. [Citation Graph (0, 0)][DBLP ] Conf ] Stasys Jukna The Effect of Null-Chains on the Complexity of Contact Schemes. [Citation Graph (0, 0)][DBLP ] Conf ] Efim B. Kinber , Thomas Zeugmann Monte-Carlo Inference and Its Relations to Reliable Frequency Identification. [Citation Graph (0, 0)][DBLP ] Conf ] Ivan Korec Semilinear Real-Time Systolic Trellis Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Tibor Kovács Inducibility of the Composition of Frontier-to-Root Tree Transformations. [Citation Graph (0, 0)][DBLP ] Conf ] Matthias Krause , Stephan Waack On Oblivious Branching Programs of Linear Length (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Maciej Liskiewicz , Krzysztof Lorys Some Time-Space Bounds for One-Tape Deterministic Turing Machines. [Citation Graph (0, 0)][DBLP ] Conf ] Igor Litovsky Rank of Rational Finitely Generated W-Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Wolfgang Maass , Theodore A. Slaman Extensional Properties of Sets of Time Bounded Complexity (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Alberto Marchetti-Spaccamela , Marco Protasi Learning Under Uniform Distribution. [Citation Graph (0, 0)][DBLP ] Conf ] M. A. Nait Abdallah An Extended Framework for Default Reasoning. [Citation Graph (1, 0)][DBLP ] Conf ] M. A. Nait Abdallah Logic Programming of Some Mathematical Paradoxes. [Citation Graph (0, 0)][DBLP ] Conf ] Ratko Orlandic , John L. Pfaltz Analysis of Compact 0-Complete Trees: A New Access Method to Large Databases. [Citation Graph (2, 0)][DBLP ] Conf ] Kai Salomaa Representation of Recursively Enumerable Languages Using Alternating Finite Tree Recognizers. [Citation Graph (0, 0)][DBLP ] Conf ] Patrice Séébold About a Family of Binary Morphisms which Stationary Words are Sturmian. [Citation Graph (0, 0)][DBLP ] Conf ] Helmut Seidl On the Finite Degree of Ambiguity of Finite Tree Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Hans-Ulrich Simon Approximation Algorithms for Channel Assignment in Cellular Radio Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Jerzy Skurczynski The Borel Hierarchy is Infinite in the Class of Regular Sets of Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Frederick N. Springsteel , Ivan Stojmenovic Parallel General Prefix Computations with Geometric, Algebraic and Other Applications. [Citation Graph (0, 0)][DBLP ] Conf ] Ludwig Staiger Kolmogorov Complexity and Hausdorff Dimension. [Citation Graph (0, 0)][DBLP ] Conf ] Magnus Steinby Tree Language Problems in Pattern Recognition Theory (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Klaus Sutner The Computational Complexity of Cellular Automata. [Citation Graph (0, 0)][DBLP ] Conf ] György Turán On Restricted Boolean Circuits. [Citation Graph (0, 0)][DBLP ] Conf ] Egon Wanke The Complexity of Connectivity Problems on Context-Free Graph Languages (Extended Abstract). [Citation Graph (1, 0)][DBLP ] Conf ] Klaus Weihrauch Constructivity, Computability, and Computational Complexity in Analysis. [Citation Graph (0, 0)][DBLP ] Conf ] 