Conferences in DBLP
Ming Li , Paul M. B. Vitányi Philosophical Issues in Kolmogorov Complexity. [Citation Graph (0, 0)][DBLP ] Conf ] Howard Straubing Circuit Complexity and the Expressive Power of Generalized First-Order Formulas. [Citation Graph (0, 0)][DBLP ] Conf ] Alfredo De Santis , Giuseppe Persiano , Moti Yung One-Message Statistical Zero-Knowledge Proofs and Space-Bounded Verifier. [Citation Graph (0, 0)][DBLP ] Conf ] Veikko Keränen Abelian Squares are Avoidable on 4 Letters. [Citation Graph (0, 0)][DBLP ] Conf ] Juhani Karhumäki , Wojciech Plandowski , Wojciech Rytter Polynomial Size Test Sets for Context-Free Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Taishin Y. Nishida Quasi-Deterministic 0L Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Gerhard Buntrock , Krzysztof Lorys On Growing Context-Sensitive Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Jeffrey Shallit Numeration Systems, Linear Recurrences, and Regular Sets (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Daniel Krob The Equality Problem for Rational Series with Multiplicities in the Tropical Semiring is Undecidable. [Citation Graph (0, 0)][DBLP ] Conf ] Mireille Clerbout , Yves Roos , Wieslaw Zielonka Semi-Commutations and Rational Expressions. [Citation Graph (0, 0)][DBLP ] Conf ] Oscar H. Ibarra , Nicholas Q. Trân New Results Concerning Synchronized Finite Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Joost Engelfriet A Greibach Normal Form for Context-free Graph Grammars. [Citation Graph (0, 0)][DBLP ] Conf ] Pierre Péladeau , Andreas Podelski On Reverse and General Definite Tree Languages (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Vikraman Arvind , Yenjo Han , Lane A. Hemachandra , Johannes Köbler , Antoni Lozano , Martin Mundhenk , Mitsunori Ogiwara , Uwe Schöning , Riccardo Silvestri , Thomas Thierauf Reductions to Sets of Low Information Content. [Citation Graph (0, 0)][DBLP ] Conf ] Ming-Jye Sheu , Timothy J. Long UP and the Low and High Hierarchies: A Relativized Separation. [Citation Graph (0, 0)][DBLP ] Conf ] Philippe Flajolet Analytic Analysis of Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Kirschenhofer , Helmut Prodinger , Wojciech Szpankowski How to Count Quickly and Accurately: A Unified Analysis of Probabilistic Counting and Other Related Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Ulrich Schmid The Average CRI-Length of a Tree Collision Resolution Algorithm in Presence of Multiplicity-Dependent Capture Effects. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Dietzfelbinger , Joseph Gil , Yossi Matias , Nicholas Pippenger Polynomial Hash Functions Are Reliable (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] R. C. Sekar , R. Ramesh , I. V. Ramakrishnan Adaptive Pattern Matching. [Citation Graph (0, 0)][DBLP ] Conf ] Yishay Mansour Randomized Interpolation and Approximation of Sparse Polynomials. [Citation Graph (0, 0)][DBLP ] Conf ] Hans L. Bodlaender , Michael R. Fellows , Tandy Warnow Two Strikes Against Perfect Phylogeny. [Citation Graph (0, 0)][DBLP ] Conf ] Guo-Qiang Zhang Disjunctive Systems and L-Domains. [Citation Graph (0, 0)][DBLP ] Conf ] Alberto Apostolico , Dany Breslauer , Zvi Galil Optimal Parallel Algorithms for Periods, Palindromes and Squares (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Andrei Z. Broder , Alan M. Frieze , Eli Shamir , Eli Upfal Near-perfect Token Distribution. [Citation Graph (0, 0)][DBLP ] Conf ] Torben Hagerup Fast Integer Merging on the EREW PRAM. [Citation Graph (0, 0)][DBLP ] Conf ] Samir Khuller , Ramakrishna Thurimella Approximation Algorithms for Graph Augmentation. [Citation Graph (0, 0)][DBLP ] Conf ] Jeffery Westbrook Fast Incremental Planarity Testing. [Citation Graph (0, 0)][DBLP ] Conf ] Johannes A. La Poutré Maintenance of Triconnected Components of Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Vijay V. Vazirani , Mihalis Yannakakis Suboptimal Cuts: Their Enumeration, Weight and Number (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Bruno Buchberger Gröbner Bases: An Introduction. [Citation Graph (0, 0)][DBLP ] Conf ] Reinhard Bündgen Buchberger's Algorithm: The Term Rewriter's Point of View (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Hubert Comon Completion of Rewrite Systems with Membership Constraints. [Citation Graph (0, 0)][DBLP ] Conf ] Günter Rote A New Metric Between Polygons and How to Compute it. [Citation Graph (0, 0)][DBLP ] Conf ] Mike Paterson , F. Frances Yao On Nearest-Neighbor Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Jirí Matousek , Raimund Seidel A Tail Estimate for Mulmuley's Segment Intersection Algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] Bernard Chazelle , Burton Rosenberg Lower Bounds on the Complexity of Simplex Range Reporting on a Pointer Machine. [Citation Graph (1, 0)][DBLP ] Conf ] Phokion G. Kolaitis , Moshe Y. Vardi Infinitary Logic for Computer Science. [Citation Graph (1, 0)][DBLP ] Conf ] Edward Y. Chang , Zohar Manna , Amir Pnueli Characterization of Temporal Property Classes. [Citation Graph (0, 0)][DBLP ] Conf ] C.-H. Luke Ong Lazy Lambda Calculus: Theories, Models and Local Structure Characterization (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Els Laenens , Dirk Vermeir , Carlo Zaniolo Logic Programming Semantics Made Easy. [Citation Graph (0, 0)][DBLP ] Conf ] Saumya K. Debray On the Complexity of Dataflow Analysis of Logic Programs. [Citation Graph (0, 0)][DBLP ] Conf ] Agostino Cortesi , Gilberto Filé , William H. Winsborough Comparison of Abstract Interpretations. [Citation Graph (0, 0)][DBLP ] Conf ] Wesley Phoa , Michael P. Fourman A Proposed Categorial Semantics for Pure ML. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas A. Henzinger , Zohar Manna , Amir Pnueli What Good Are Digital Clocks? [Citation Graph (0, 0)][DBLP ] Conf ] Faron Moller , Chris M. N. Tofts Behavioural Abstraction in TCCS. [Citation Graph (0, 0)][DBLP ] Conf ] Carolyn Brown , Doug Gurr Timing Petri Nets Categorically. [Citation Graph (0, 0)][DBLP ] Conf ] Paul Gastin , Antoine Petit Asynchronous Cellular Automata for Infinite Traces. [Citation Graph (0, 0)][DBLP ] Conf ] P. W. Hoogers , H. C. M. Kleijn , P. S. Thiagarajan A Trace Semantics for Petri Nets (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Walter Vogler Asynchronous Communication of Petri Nets and the Refinement of Transitions. [Citation Graph (0, 0)][DBLP ] Conf ] Ugo Montanari , Daniel Yankelevich A Parametric Approach to Localities. [Citation Graph (0, 0)][DBLP ] Conf ] Pierpaolo Degano , Corrado Priami Proved Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Ernst-Rüdiger Olderog Interfaces between Languages for Communicating Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Donald Sannella , Andrzej Tarlecki Towards Formal Development of Programs from Algebraic Specifications: Model-Theoretic Foundations. [Citation Graph (0, 0)][DBLP ] Conf ] Limor Fix , Nissim Francez , Orna Grumberg Program Composition via Unification. [Citation Graph (0, 0)][DBLP ] Conf ] Robin Milner , Davide Sangiorgi Barbed Bisimulation. [Citation Graph (0, 0)][DBLP ] Conf ] Alexander Moshe Rabinovich Checking Equivalences Between Concurrent Systems of Finite Agents (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Rance Cleaveland , Scott A. Smolka , Amy E. Zwarico Testing Preorders for Probabilistic Processes. [Citation Graph (0, 0)][DBLP ] Conf ] 