Conferences in DBLP
Egon Börger A Logical Operational Semantics of Full Prolog, Part II: Built-in Predicates for Database Manipulation. [Citation Graph (0, 0)][DBLP ] Conf ] Jean-Pierre Jouannaud Syntactic Theories. [Citation Graph (0, 0)][DBLP ] Conf ] Dexter Kozen On Kleene Algebras and Closed Semirings. [Citation Graph (0, 0)][DBLP ] Conf ] Jan Krajícek , Pavel Pudlák , Jiri Sgall Interactive Computations of Optimal Solutions. [Citation Graph (0, 0)][DBLP ] Conf ] Christoph Meinel Restricted Branching Programs and Their Computational Power. [Citation Graph (0, 0)][DBLP ] Conf ] Friedhelm Meyer auf der Heide Dynamic Hashing Strategies. [Citation Graph (0, 0)][DBLP ] Conf ] Alan L. Selman One-Way Functions in Complexity Theory. [Citation Graph (0, 0)][DBLP ] Conf ] Jerzy Tiuryn Type Inference Problems: A Survey. [Citation Graph (1, 0)][DBLP ] Conf ] Jacobo Torán Counting the Number of Solutions. [Citation Graph (0, 0)][DBLP ] Conf ] Willem G. Vree Implementation of Parallel Graph Reduction by Explicit Annotation and Program Transformation. [Citation Graph (0, 0)][DBLP ] Conf ] Maris Alberts Interrogative Complexity of omega-Languages' Recognition. [Citation Graph (0, 0)][DBLP ] Conf ] Eric Allender , Ulrich Hertrampf On the Power of Uniform Families of Constant Depth Treshold Circuits. [Citation Graph (0, 0)][DBLP ] Conf ] Fabrizio d'Amore , Paolo Giulio Franciosa Separating Sets of Hyperrectangles. [Citation Graph (0, 0)][DBLP ] Conf ] Sanjoy K. Baruah , Rodney R. Howell , Louis E. Rosier On Preemptive Scheduling of Periodic, Real-Time Tasks on One Processor. [Citation Graph (0, 0)][DBLP ] Conf ] Arie de Bruin , Erik P. de Vink Retractions in Comparing Prolog Semantics (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Gerhard Buntrock , Lane A. Hemachandra , Dirk Siefkes Using Inductive Counting to Simulate Nondeterministic Computation. [Citation Graph (0, 0)][DBLP ] Conf ] Ivana Cerná Some Properties of Zerotesting Bounded One-Way Multicounter Machines. [Citation Graph (0, 0)][DBLP ] Conf ] Marek Chrobak , Lawrence L. Larmore On Fast Algorithms for Two Servers. [Citation Graph (0, 0)][DBLP ] Conf ] Mireille Clerbout , D. Gonzalez Decomposition of Semi Commutations. [Citation Graph (0, 0)][DBLP ] Conf ] Maxime Crochemore , Wojciech Rytter Parallel Construction of Minimal Suffix and Factor Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Karel Culik II , Simant Dube Affine Automata: A Technique to Generate Complex Images. [Citation Graph (0, 0)][DBLP ] Conf ] Carsten Damm The Complexity of Symmetric Functions in Parity Normal Forms. [Citation Graph (0, 0)][DBLP ] Conf ] Philippe Darondeau , Pierpaolo Degano Event Structures, Causal Trees, and Refinements. [Citation Graph (0, 0)][DBLP ] Conf ] Pratul Dublish , S. N. Maheshwari Query Languages which Express all PTIME Queries for Trees and Unicyclic Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Emanuela Fachini , Andrea Maggiolo-Schettini , Davide Sangiorgi Comparisons Among Classes of Y-Tree Systolic Automata. [Citation Graph (0, 0)][DBLP ] Conf ] William I. Gasarch , Lane A. Hemachandra , Albrecht Hoene On Checking Versus Evaluation of Multiple Queries. [Citation Graph (0, 0)][DBLP ] Conf ] Ricard Gavaldà , Leen Torenvliet , Osamu Watanabe , José L. Balcázar Generalized Kolmogorov Complexity in Relativized Separations (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Antonio Gavilanes-Franco A First-Order Logic for Partial Recursive Functions. [Citation Graph (0, 0)][DBLP ] Conf ] Viliam Geffert Speed-Up Theorem Without Tape Compression. [Citation Graph (0, 0)][DBLP ] Conf ] Dainis Geidmanis On Possibilities of One-Way Synchronized and Alternating Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Andreas Goerdt Unrestricted Resolution versus N-Resolution. [Citation Graph (0, 0)][DBLP ] Conf ] Robert Gold , Walter Vogler Quality Criteria for Partial Order Semantics of Place/Transition-Nets. [Citation Graph (0, 0)][DBLP ] Conf ] Wolfgang Golubski , Wolfram-Manfred Lippe Tree-Stack Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Michael R. Hansen , Zhou Chaochen Specification & Verification of Higher Order Processes. [Citation Graph (0, 0)][DBLP ] Conf ] Friedhelm Hinz The Membership Problem for Context-Free Chain Code Picture Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Juraj Hromkovic , Claus-Dieter Jeschke , Burkhard Monien Optimal Algorithms for Dissemination of Information in Some Interconnection Networks (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Bengt Jonsson A Hierarchy of Compositional Models of I/O-Automata (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Janis Kaneps , Rusins Freivalds Minimal Nontrivial Space Complexity of Probabilistic One-Way Turing Machines. [Citation Graph (0, 0)][DBLP ] Conf ] Marek Karpinski , Friedhelm Meyer auf der Heide On the Complexity of Genuinely Polynomial Computation. [Citation Graph (0, 0)][DBLP ] Conf ] Emmanuel Kounalis Pumping Lemmas for Tree Languages Generated by Rewrite Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Miroslaw Kowaluk , Klaus W. Wagner Vector Language: Simple Description of Hard Instances (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Matthias Krause Separating +L From L, NL, co-NL and AL (=P) for Oblivious Turing Machines of Linear Access Time. [Citation Graph (0, 0)][DBLP ] Conf ] Mirko Krivánek The Use of Graphs of Elliptical Influence in Visuel Hierarchical Clustering. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus-Jörn Lange , Peter Rossmanith Characterizing Unambiguous Augmented Pushdown Automata by Circuits. [Citation Graph (0, 0)][DBLP ] Conf ] Michel Latteux , Erick Timmerman Rational omega-Transductions. [Citation Graph (0, 0)][DBLP ] Conf ] Christos Levcopoulos , Ola Petersson Splitsort - An Adaptive Sorting Algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] Vincenzo Manca , Antonino Salibra Equational Calculi for Many-Sorted Algebras with Empty Carrier Sets. [Citation Graph (0, 0)][DBLP ] Conf ] Edward Ochmanski Semi-Commutation and Deterministic Petri Nets. [Citation Graph (0, 0)][DBLP ] Conf ] Michel Parigot Internal Labellings in Lambda-Calculus. [Citation Graph (0, 0)][DBLP ] Conf ] Ana Pasztor A Sup-Preserving Completion of Ordered Partial Algebras. [Citation Graph (0, 0)][DBLP ] Conf ] Marek Priotrów ATIME(N) is Closed Under Counting. [Citation Graph (0, 0)][DBLP ] Conf ] Regimantas Pliuskevicius Investigation of Finitary Calculi for the Temporal Logics by Means of Infinitary Calculi. [Citation Graph (0, 0)][DBLP ] Conf ] Axel Poigné Typed Horn Logic. [Citation Graph (0, 0)][DBLP ] Conf ] Ildikó Sain Results on the Glory of the Past. [Citation Graph (0, 0)][DBLP ] Conf ] Pham Huu Uyen A Stronger Version of Parikh Theorem. [Citation Graph (0, 0)][DBLP ] Conf ] Stephan Waack The Parallel Complexity of Some Constructions in Combinatorial Group Theory (Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Igor Walukiewicz Gentzen Type Axiomatizations for PAL. [Citation Graph (0, 0)][DBLP ] Conf ] Andreas Weber Distance Automata Having Large Finite Distance or Finite Ambiguity. [Citation Graph (0, 0)][DBLP ] Conf ] Ingo Wegener Bottom-Up-Heap Sort, a New Variant of Heap Sort Beating on Average Quick Sort (if n is not very small). [Citation Graph (0, 0)][DBLP ] Conf ] Ingo Wegener , Norbert Wurm , Sang-Zin Yi Symmetric Functions in AC0 A Can Be Computed in Constant Depth With Very Small Size. [Citation Graph (0, 0)][DBLP ] Conf ] Manfred Wiegers The k-section of Treewidth Restricted Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas Zeugmann Computing Large Polynomial Powers Very Fast in Parallel. [Citation Graph (0, 0)][DBLP ] Conf ] 