Conferences in DBLP
Klaus Ambos-Spies On the Relative Complexity of Subproblems of Intractable Problems. [Citation Graph (0, 0)][DBLP ] Conf ] László Babai On Lovász' Lattice Reduction and the Nearest Lattice Point Problem (Shortened Version). [Citation Graph (0, 0)][DBLP ] Conf ] Bernd Becker , Hans-Georg Osthof Layouts with Wires of Balanced Length. [Citation Graph (0, 0)][DBLP ] Conf ] Norbert Blum On the Single-Operation Worst-Case Time Complexity on the Disjoint Set Union Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Luc Boasson , Antoine Petit Deterministic Languages and Non-Generators. [Citation Graph (0, 0)][DBLP ] Conf ] Hans L. Bodlaender , Jan van Leeuwen Simulation of Large Networks on Smaller Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Gérard Boudol , Gérard Roucairol , Robert de Simone Petri Nets and Algebraic Calculi of Processes. [Citation Graph (0, 0)][DBLP ] Conf ] Wilfried Brauer , Klaus-Jörn Lange Non-Deterministic Two-Tape Automata are More Powerful Then Deterministic Ones. [Citation Graph (0, 0)][DBLP ] Conf ] Clelia de Felice Construction of a Family of Factorizing Codes. [Citation Graph (0, 0)][DBLP ] Conf ] Volker Diekert On Hotz Groups and Homomorphic Images of Sentential Form Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Dybjer Using Domain Algebras to Prove the Correctness of a Compiler. [Citation Graph (0, 0)][DBLP ] Conf ] Ulrich Faigle , György Turán Sorting and Recognition Problems for Ordered Sets. [Citation Graph (0, 0)][DBLP ] Conf ] Gilberto Filé Tree Automata and Logic Programs. [Citation Graph (0, 0)][DBLP ] Conf ] Patrick C. Fischer , Dirk Van Gucht Structure of Relations Satisfying Certain Families of Dependencies. [Citation Graph (4, 0)][DBLP ] Conf ] Greg N. Frederickson A Single Source Shortest Path Algorithm for a Planar Distributed Network. [Citation Graph (0, 0)][DBLP ] Conf ] Shaodi Gao An Algorithm for Two-Layer Channel Routing. [Citation Graph (0, 0)][DBLP ] Conf ] Ralf Hartmut Güting , Thomas Ottmann New Algorithms for Special Cases of the Hidden Line Elimination Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Bettina Helfrich An Algorithm to Construct Minkowski-Reduced Lattice-Bases. [Citation Graph (0, 0)][DBLP ] Conf ] Christine Irastorza Base non finie de varietes. [Citation Graph (0, 0)][DBLP ] Conf ] Rolf G. Karlsson , J. Ian Munro Proximity of a Grid. [Citation Graph (0, 0)][DBLP ] Conf ] Ludek Kucera An O(N^(1.5+epsilon)) Expected Time Algorithm for Canonization and Isomorphism Testing of Trivalent Garphs. [Citation Graph (0, 0)][DBLP ] Conf ] Joseph Y.-T. Leung , Burkhard Monien On the Complexity of Deadlock Recovery. [Citation Graph (0, 0)][DBLP ] Conf ] William F. McColl On the Planar Monotone Computation of Threshold Functions. [Citation Graph (0, 0)][DBLP ] Conf ] William F. McColl Planar Circuits Have Short Specifications. [Citation Graph (0, 0)][DBLP ] Conf ] Joseph O'Rourke , Subhash Suri , Heather Booth Shortest Paths on Polyhedral Surfaces. [Citation Graph (0, 0)][DBLP ] Conf ] Sara Porat , Nissim Francez Fairness in Context-Free Grammars under Canonical Derivations. [Citation Graph (0, 0)][DBLP ] Conf ] Jean-Luc Richier Distributed Termination in CSP: Symmetric Solutions with Minimal Storage. [Citation Graph (0, 0)][DBLP ] Conf ] Hans Rohnert A Dynamization of the All Pairs Least Cost Path Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Louis E. Rosier , Hsu-Chun Yen Boundedness, Empty Channel Detection and Synchronization for Communicating Finite State Machines. [Citation Graph (0, 0)][DBLP ] Conf ] Véronique Royer Deriving Stack Semantics Congruent to Standard Denotational Semantics. [Citation Graph (0, 0)][DBLP ] Conf ] Jörg-Rüdiger Sack , Godfried T. Toussaint Translating Polygons in the Plane. [Citation Graph (0, 0)][DBLP ] Conf ] Nicola Santoro , Jeffrey B. Sidney , Stuart J. Sidney , Jorge Urrutia Geometric Containment is not Reducible to Pareto Dominance. [Citation Graph (0, 0)][DBLP ] Conf ] Paul G. Spirakis The Volume of the Union of Many Sheres and Point Inclusion Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Leen Torenvliet , Peter van Emde Boas Combined Simplicity and Immunity in Relativized NP. [Citation Graph (0, 0)][DBLP ] Conf ] Pascal Weil Groups, Codes and Unambiguous Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Dan E. Willard Reduced Memory Space for Multi-Dimensional Search Trees (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] 