Conferences in DBLP
Stefan Näher , Kurt Mehlhorn LEDA: A Library of Efficient Data Types and Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Dietzfelbinger , Friedhelm Meyer auf der Heide A New Universal Class of Hash Functions and Dynamic Hashing in Real Time. [Citation Graph (0, 0)][DBLP ] Conf ] Jon G. Riecke A Complete and Decidable Proof System for Call-by-Value Equalities (Preliminary Report). [Citation Graph (0, 0)][DBLP ] Conf ] Michael I. Schwartzbach Static Correctness of Hierarchical Procedures. [Citation Graph (0, 0)][DBLP ] Conf ] Sophie Malecki Generic Terms Having No Polymorphic Types. [Citation Graph (0, 0)][DBLP ] Conf ] Daniel Krob A Complete System of B-Rational Identities. [Citation Graph (0, 0)][DBLP ] Conf ] Aldo de Luca , Stefano Varricchio On Non-Counting Regular Classes. [Citation Graph (0, 0)][DBLP ] Conf ] Marcella Anselmo Two-Way Automata with Multiplicity. [Citation Graph (0, 0)][DBLP ] Conf ] Werner Kuich Omega-Continuous Semirings, Algebraich Systems and Pushdown Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Viliam Geffert Nondeterministic Computations in Sublogarithmic Space and Space Constructibility. [Citation Graph (0, 0)][DBLP ] Conf ] Juraj Wiedermann Normalizing and Accelerating RAM Computations and the Problem of Reasonable Space Measures. [Citation Graph (0, 0)][DBLP ] Conf ] Osamu Watanabe A Formal Study of Learning via Queries. [Citation Graph (0, 0)][DBLP ] Conf ] Sanjay Jain , Arun Sharma Language Learning by a "Team" (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Robin Milner Functions as Processes. [Citation Graph (0, 0)][DBLP ] Conf ] Radha Jagadeesan , Prakash Panangaden A Domain-Theoretic Model for a Higher-Order Process Calculus. [Citation Graph (0, 0)][DBLP ] Conf ] Manfred Droste Concurrency, Automata and Domains. [Citation Graph (0, 0)][DBLP ] Conf ] Matthew Hennessy , Anna Ingólfsdóttir A Theory of Communicating Processes with Value-Passing. [Citation Graph (0, 0)][DBLP ] Conf ] Philippe Flajolet , Paolo Sipala , Jean-Marc Steyaert Analytic Variations on the Common Subexpression Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Joseph Cheriyan , Torben Hagerup , Kurt Mehlhorn Can A Maximum Flow be Computed on o(nm) Time? [Citation Graph (0, 0)][DBLP ] Conf ] Alexander A. Razborov On the Distributional Complexity of Disjontness. [Citation Graph (0, 0)][DBLP ] Conf ] Evangelos Kranakis , Danny Krizanc , Jacob van den Berg Computing Boolean Functions on Anonymous Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Oded Goldreich , Hugo Krawczyk On the Composition of Zero-Knowledge Proof Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Ronald V. Book , Jack H. Lutz , Shouwen Tang Additional Queries to Random and Pseudorandom Oracles. [Citation Graph (0, 0)][DBLP ] Conf ] Alexander Moshe Rabinovich , Boris A. Trakhtenbrot Communication among Relations (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Prakash Panangaden , Vasant Shanbhogue , Eugene W. Stark Stability and Sequentiality in Dataflow Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Rajeev Alur , David L. Dill Automata For Modeling Real-Time Systems. [Citation Graph (1, 0)][DBLP ] Conf ] Costas Courcoubetis , Mihalis Yannakakis Markov Decision Processes and Regular Events (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Jan Willem Klop Term Rewriting Systems: From Church-Rosser to Knuth-Bendix and Beyond. [Citation Graph (0, 0)][DBLP ] Conf ] Rakesh M. Verma , I. V. Ramakrishnan Nonoblivious Normalization Algorithms for Nonlinear Rewrite Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Catuscia Palamidessi Algebraic Properties of Idempotent Substitutions. [Citation Graph (0, 0)][DBLP ] Conf ] David P. Dobkin , David G. Kirkpatrick Determining the Separation of Preprocessed Polyhedra - A Unified Approach. [Citation Graph (0, 0)][DBLP ] Conf ] Leonidas J. Guibas , Donald E. Knuth , Micha Sharir Randomized Incremental Construction of Delaunay and Voronoi Diagrams. [Citation Graph (0, 0)][DBLP ] Conf ] Richard Cole , Michael T. Goodrich , Colm Ó'Dúnlaing Merging Free Trees in Parallel for Efficient Voronoi Diagram Construction (Preliminary Version). [Citation Graph (0, 0)][DBLP ] Conf ] David S. Johnson Local Optimization and the Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Mark Jerrum , Alistair Sinclair Polynomial-Time Approximation Algorithms for Ising Model (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] John E. Savage , Markus G. Wloka On Parallelizing Graph-Partitioning Heuristics. [Citation Graph (0, 0)][DBLP ] Conf ] Christian Choffrut Iterated Substitutions and Locally Catanative Systems: A Decidability Result in the Binary Case. [Citation Graph (0, 0)][DBLP ] Conf ] Mireille Clerbout , Michel Latteux , Yves Roos Decomposition of Partial Commutations. [Citation Graph (0, 0)][DBLP ] Conf ] Maryse Pelletier Boolean Closure and Unambiguity of Rational Sets. [Citation Graph (0, 0)][DBLP ] Conf ] Kim Guldstrand Larsen , Liu Xinxin Compositionality Through an Operational Semantics of Contexts. [Citation Graph (0, 0)][DBLP ] Conf ] Joachim Parrow Structural and Behavioural Equivalences of Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Doron Peled , Amir Pnueli Proving Partial Order Liveness Properties. [Citation Graph (0, 0)][DBLP ] Conf ] Frank S. de Boer A Proof System for the Parallel Object-Oriented Language POOL. [Citation Graph (0, 0)][DBLP ] Conf ] Norbert Blum A New Approach to Maximum Matching in General Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Giuseppe Di Battista , Roberto Tamassia On-Line Graph Algorithms with SPQR-Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Victor Y. Pan , John H. Reif On the Bit-Complexity of Discrete Solutions of PDEs: Compact Multigrid. [Citation Graph (0, 0)][DBLP ] Conf ] Jan Friso Groote , Frits W. Vaandrager An Efficient Algorithm for Branching Bisimulation and Stuttering Equivalence. [Citation Graph (0, 0)][DBLP ] Conf ] Neil D. Jones Partial Evaluation, Self-Application and Types. [Citation Graph (0, 0)][DBLP ] Conf ] J. V. Tucker , S. S. Wainer , Jeffery I. Zucker Provable Computable Functions on Abstract Data Types. [Citation Graph (0, 0)][DBLP ] Conf ] Hubert Comon Equational Formulas in Order-Sorted Algebras. [Citation Graph (0, 0)][DBLP ] Conf ] Michael T. Goodrich , Mikhail J. Atallah , Mark H. Overmars An Input-Size/Output-Size Trade-Off in the Time-Complexity of Rectilinear Hidden Surface Removal (Preliminary Version). [Citation Graph (0, 0)][DBLP ] Conf ] Helmut Alt , Johannes Blömer , Hubert Wagener Approximation of Convex Polygons. [Citation Graph (0, 0)][DBLP ] Conf ] Frank Hoffmann On the Rectilinear Art Gallery Problem (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Yossi Matias , Uzi Vishkin On Parallel Hashing and Integer Sorting (Extended Summary). [Citation Graph (0, 0)][DBLP ] Conf ] Prabhakar Radge The Parallel Simplicity of Compaction and Chaining. [Citation Graph (0, 0)][DBLP ] Conf ] Faron Moller The Importance of the Left Merge Operator in Process Algebras. [Citation Graph (0, 0)][DBLP ] Conf ] Sanjiva Prasad , Alessandro Giacalone , Prateek Mishra Operational and Algebraic Semantics for Facile: A Symmetric Integration of Concurrent and Functional Programming. [Citation Graph (0, 0)][DBLP ] Conf ] 