Conferences in DBLP
Giorgio Ausiello , Giuseppe F. Italiano , Umberto Nanni Hypergraph Traversal Revisited: Cost Measures and Dynamic Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Egon Börger , Wolfram Schulte Defining the Java Virtual Machine as Platform for Provably Correct Java Compilation. [Citation Graph (0, 0)][DBLP ] Conf ] David Harel Towards a Theory of Recursive Structures. [Citation Graph (1, 0)][DBLP ] Conf ] Yonit Kesten , Amir Pnueli Modularization and Abstraction: The Keys to Practical Formal Verification. [Citation Graph (0, 0)][DBLP ] Conf ] Wolfgang Maass On the Role of Time and Space in Neural Computation. [Citation Graph (0, 0)][DBLP ] Conf ] Kurt Mehlhorn , Stefan Näher From Algorithms to Working Programs: On the Use of Program Checking in LEDA. [Citation Graph (0, 0)][DBLP ] Conf ] Silvio Micali Computationally-Sound Checkers. [Citation Graph (0, 0)][DBLP ] Conf ] Mogens Nielsen Reasoning About the Past. [Citation Graph (0, 0)][DBLP ] Conf ] Pavel Pudlák Satisfiability - Algorithms and Logic. [Citation Graph (0, 0)][DBLP ] Conf ] Colin Stirling The Joys of Bisimulation. [Citation Graph (0, 0)][DBLP ] Conf ] Jirí Wiedermann Towards Algorithmic Explanation of Mind Evolution and Functioning. [Citation Graph (0, 0)][DBLP ] Conf ] Mikel Aldaz , Joos Heintz , Guillermo Matera , José Luis Montaña , Luis Miguel Pardo Combinatorial Hardness Proofs for Polynomial Evaluation. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Alekhnovich , Samuel R. Buss , Shlomo Moran , Toniann Pitassi Minimum Propositional Proof Length is NP-Hard to Linearly Approximate. [Citation Graph (0, 0)][DBLP ] Conf ] Marek Chrobak , Christoph Dürr Reconstructing Polyatomic Structures from Discrete X-Rays: NP-Completeness Proof for Three Atoms. [Citation Graph (0, 0)][DBLP ] Conf ] Nikolai N. Kuzjurin Locally Explicit Construction of Rödl's Asymptotically Good Packings. [Citation Graph (0, 0)][DBLP ] Conf ] Matthias Baaz , Agata Ciabattoni , Christian G. Fermüller , Helmut Veith Proof Theory of Fuzzy Logics: Urquhart's C and Related Logics. [Citation Graph (0, 0)][DBLP ] Conf ] Richard F. Bonner , Rusins Freivalds , Janis Lapins , Antra Lukjanska Nonstochastic Languages as Projections of 2-Tape Quasideterministic Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Flemming Nielson , Hanne Riis Nielson Flow Logic for Imperative Objects. [Citation Graph (0, 0)][DBLP ] Conf ] Alexander Moshe Rabinovich Expressive Completeness of Temporal Logic of Action. [Citation Graph (0, 0)][DBLP ] Conf ] Maria C. F. Ferreira , Delia Kesner , Laurence Puel Reducing AC-Termination to Termination. [Citation Graph (0, 0)][DBLP ] Conf ] Zoltán Fülöp , Eija Jurvanen , Magnus Steinby , Sándor Vágvölgyi On One-Pass Term Rewriting. [Citation Graph (0, 0)][DBLP ] Conf ] Miki Hermann , Gernot Salzer On the Word, Subsumption, and Complement Problem for Recurrent Term Schematizations. [Citation Graph (0, 0)][DBLP ] Conf ] Hélène Touzet Encoding the Hydra Battle as a Rewrite System. [Citation Graph (0, 0)][DBLP ] Conf ] Christian Hagenah , Anca Muscholl Computing epsilon-Free NFA from Regular Expressions in O(n log²(n)) Time. [Citation Graph (0, 0)][DBLP ] Conf ] Michel Latteux , David Simplot , Alain Terlutte Iterated Length-Preserving Rational Transductions. [Citation Graph (0, 0)][DBLP ] Conf ] Holger Petersen The Head Hierarchy for Oblivious Finite Automata with Polynomial Advice Collapses. [Citation Graph (0, 0)][DBLP ] Conf ] Géraud Sénizergues The Equivalence Problem for Deterministic Pushdown Transducers into Abelian Groups. [Citation Graph (0, 0)][DBLP ] Conf ] Gilles Barthe The Semi-Full Closure of Pure Type Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Marcin Benke Predicative Polymorphic Subtyping. [Citation Graph (0, 0)][DBLP ] Conf ] Gavin M. Bierman A Computational Interpretation of the lambda-µ-Calculus. [Citation Graph (0, 0)][DBLP ] Conf ] Jacek Chrzaszcz Polymorphic Subtyping Without Distributivity. [Citation Graph (0, 0)][DBLP ] Conf ] Paul Gastin , Raphaël Meyer , Antoine Petit A (Non-elementary) Modular Decision Procedure for LTrL. [Citation Graph (0, 0)][DBLP ] Conf ] Roberto Giacobazzi , Francesco Ranzato , Francesca Scozzari Complete Abstract Interpretations Made Constructive. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas Hune , Mogens Nielsen Timed Bisimulation and Open Maps. [Citation Graph (0, 0)][DBLP ] Conf ] Jirí Srba Deadlocking States in Context-Free Process Algebra. [Citation Graph (0, 0)][DBLP ] Conf ] Kazuyuki Amano , Akira Maruoka A Superpolynomial Lower Bound for a Circuit Computing the Clique Function with At Most (1/6) log log n Negation Gates. [Citation Graph (0, 0)][DBLP ] Conf ] Andris Ambainis , David A. Mix Barrington , Huong LeThanh On Counting AC0 Circuits with Negative Constants. [Citation Graph (0, 0)][DBLP ] Conf ] Lane A. Hemaspaandra , Jörg Rothe A Second Step Towards Circuit Complexity-Theoretic Analogs of Rice's Theorem. [Citation Graph (0, 0)][DBLP ] Conf ] E. Allen Emerson , Richard J. Trefler Model Checking Real-Time Properties of Symmetric Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Grohe , Thomas Schwentick Locality of Order-Invariant First-Order Formulas. [Citation Graph (0, 0)][DBLP ] Conf ] Alessandra Di Pierro , Herbert Wiklicky Probabilistic Concurrent Constraint Programming: Towards a Fully Abstract Model. [Citation Graph (0, 0)][DBLP ] Conf ] Alex K. Simpson Lazy Functional Algorithms for Exact Real Functionals. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus Ambos-Spies , Steffen Lempp , Gunther Mainhardt Randomness vs. Completeness: On the Diagonalization Strength of Resource-Bounded Random Sets. [Citation Graph (0, 0)][DBLP ] Conf ] Levke Bentzien Positive Turing and Truth-Table Completeness for NEXP Are Incomparable. [Citation Graph (0, 0)][DBLP ] Conf ] Judy Goldsmith , Mitsunori Ogihara , Jörg Rothe Tally NP Sets and Easy Census Functions. [Citation Graph (0, 0)][DBLP ] Conf ] Johannes Köbler , Rainer Schuler Average-Case Intractability vs. Worst-Case Intractability. [Citation Graph (0, 0)][DBLP ] Conf ] Tero Harju , Alexandru Mateescu , Arto Salomaa Shuffle on Trajectories: The Schützenberger Product and Related Operations. [Citation Graph (0, 0)][DBLP ] Conf ] Werner Kuich Gaußian Elimination and a Characterization of Algebraic Power Series. [Citation Graph (0, 0)][DBLP ] Conf ] Luis-Miguel Lopez , Philippe Narbel D0L-Systems and Surface Automorphisms. [Citation Graph (0, 0)][DBLP ] Conf ] Isabelle Ryl , Yves Roos , Mireille Clerbout About Synchronization Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus Barthelmann When Can an Equational Simple Graph Be Generated by Hyperedge Replacement? [Citation Graph (0, 0)][DBLP ] Conf ] Martin Große-Rhode , Francesco Parisi-Presicce , Marta Simeoni Spatial and Temporal Refinement of Typed Graph Transformation Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas Hofmeister , Hanno Lefmann Approximating Maximum Independent Sets in Uniform Hypergraphs. [Citation Graph (0, 0)][DBLP ] Conf ] Salvatore La Torre , Margherita Napoli Representing Hyper-Graphs by Regular Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Kazuo Iwama , Chuzo Iwamoto Improved Time and Space Hierarchies of One-Tape Off-Line TMs. [Citation Graph (0, 0)][DBLP ] Conf ] Pawel Mielniczuk , Leszek Pacholski Tarskian Set Constraints Are in NEXPTIME. [Citation Graph (0, 0)][DBLP ] Conf ] Sergei G. Vorobyov forall exists*-Equational Theory of Context Unification is Pi1 0 -Hard. [Citation Graph (0, 0)][DBLP ] Conf ] Jirí Wiedermann Speeding-Up Nondeterministic Single-Tape Off-Line Computations by One Alternation. [Citation Graph (0, 0)][DBLP ] Conf ] Bruno Courcelle , Denis Lapoire Facial Circuits of Planar Graphs and Context-Free Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Kazuo Iwama , Mitsushi Nouzoe , Shuzo Yajima Optimizing OBDDs Is Still Intractable for Monotone Functions. [Citation Graph (0, 0)][DBLP ] Conf ] Harry Preuß , Anand Srivastav Blockwise Variable Orderings for Shared BDDs. [Citation Graph (0, 0)][DBLP ] Conf ] Anna Slobodová On the Composition Problem for OBDDs with Multiple Variable Orders. [Citation Graph (0, 0)][DBLP ] Conf ] Christian Choffrut , Sándor Horváth Equations in Transfinite Strings. [Citation Graph (0, 0)][DBLP ] Conf ] Maxime Crochemore , Filippo Mignosi , Antonio Restivo Minimal Forbidden Words and Factor Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Juhani Karhumäki , Ján Manuch , Wojciech Plandowski On Defect Effect of Bi-Infinite Words. [Citation Graph (0, 0)][DBLP ] Conf ] Roman M. Kolpakov , Gregory Kucherov , Yuriy Tarannikov On Repetition-Free Binary Words of Minimal Density. [Citation Graph (0, 0)][DBLP ] Conf ] Sergei L. Bezrukov , Joe D. Chavez , L. H. Harper , Markus Röttger , Ulf-Peter Schroeder Embedding of Hypercubes into Grids. [Citation Graph (0, 0)][DBLP ] Conf ] Hans L. Bodlaender , Torben Hagerup Tree Decompositions of Small Diameter. [Citation Graph (0, 0)][DBLP ] Conf ] Hajo Broersma , Andreas Huck , Ton Kloks , Otto R. Koppius , Dieter Kratsch , Haiko Müller , Hilde Tuinstra Degree-Preserving Forests. [Citation Graph (0, 0)][DBLP ] Conf ] Andreas Crauser , Kurt Mehlhorn , Ulrich Meyer , Peter Sanders A Parallelization of Dijkstra's Shortest Path Algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] Bruno Durand , Sylvain Porrot Comparison Between the Complexity of a Function and the Complexity of Its Graph. [Citation Graph (0, 0)][DBLP ] Conf ] Henning Fernau , Ludwig Staiger IFS and Control Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Oliver Matz One Quantifier Will Do in Existential Monadic Second-Order Logic over Pictures. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus Reinhardt On Some Recognizable Picture-Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Vincenzo Auletta , Ioannis Caragiannis , Christos Kaklamanis , Pino Persiano On the Complexity of Wavelength Converters. [Citation Graph (0, 0)][DBLP ] Conf ] Carsten Damm On Boolean vs. Modular Arithmetic for Circuits and Communication Protocols. [Citation Graph (0, 0)][DBLP ] Conf ] Juraj Hromkovic Communication Complexity and Lower Bounds on Multilective Computations. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus Weihrauch , Xizhong Zheng A Finite Hierarchy of the Recursively Enumerable Real Numbers. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas Buchholz , Andreas Klein , Martin Kutrib One Guess One-Way Cellular Arrays. [Citation Graph (0, 0)][DBLP ] Conf ] Gianpiero Cattaneo , Luciano Margara Topological Definitions of Chaos Applied to Cellular Automata Dynamics. [Citation Graph (0, 0)][DBLP ] Conf ] Giovanni Manzini Characterization of Sensitive Linear Cellular Automata with Respect to the Counting Distance. [Citation Graph (0, 0)][DBLP ] Conf ] Jacques Mazoyer , Ivan Rapaport Additive Cellular Automata over Zp and the Bottom of (CA, <=). [Citation Graph (0, 0)][DBLP ] Conf ] 