Conferences in DBLP
Maurizio Gabbrielli , Giorgio Levi On the Semantics of Logic Programs. [Citation Graph (0, 0)][DBLP ] Conf ] Hong Chen , Jieh Hsiang Logic Programming with Recurrence Domains. [Citation Graph (1, 0)][DBLP ] Conf ] Antonio Bucciarelli , Thomas Ehrhard Extensional Embedding of a Strongly Stable Model of PCF. [Citation Graph (0, 0)][DBLP ] Conf ] Christine Ernoult , Alan Mycroft Uniform Ideals and Strictness Analysis. [Citation Graph (0, 0)][DBLP ] Conf ] Val Tannen , Ramesh Subrahmanyam Logical and Computational Aspects of Programming with Sets/Bags/Lists. [Citation Graph (24, 0)][DBLP ] Conf ] Ahmed Bouajjani , Jean-Claude Fernandez , Susanne Graf , Carlos Rodriguez , Joseph Sifakis Safety for Branching Time Semantics. [Citation Graph (0, 0)][DBLP ] Conf ] Limor Fix , Nissim Francez , Orna Grumberg Program Composition and Modular Verification. [Citation Graph (0, 0)][DBLP ] Conf ] Rajeev Alur , Costas Courcoubetis , David L. Dill Model-Checking for Probabilistic Real-Time Systems (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Rance Cleaveland , Bernhard Steffen Computing Behavioural Relations, Logically. [Citation Graph (0, 0)][DBLP ] Conf ] Yosi Ben-Asher , David Peleg , R. Ramaswami , Assaf Schuster The POwer of Reconfiguration. [Citation Graph (0, 0)][DBLP ] Conf ] Jean-Denis Fouks General Resolution of Tseitin Formulas is Hard. [Citation Graph (0, 0)][DBLP ] Conf ] Sampath Kannan , Andrew Chi-Chih Yao Program Checkers for Probability Generation. [Citation Graph (0, 0)][DBLP ] Conf ] Janis Kaneps , Rusins Freivalds Running Time to Recognize Nonregular Languages by 2-Way Probabilistic Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Rafael Casas , Josep Díaz , Conrado Martinez Static on Random Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Kim Guldstrand Larsen The Expressive Power of Implicit Specifications. [Citation Graph (0, 0)][DBLP ] Conf ] Wang Yi CCS + Time = An Interleaving Model for Real Time Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Volker Diekert , Edward Ochmanski , Klaus Reinhardt On Confluent Semi-Commutations - Decidability and Complexity Results. [Citation Graph (0, 0)][DBLP ] Conf ] Gérard Duchamp , Daniel Krob Lazard's Factorizations of Free Partially Commutative Monoids. [Citation Graph (0, 0)][DBLP ] Conf ] Paul Gastin , Antoine Petit , Wieslaw Zielonka A Kleene Theorem for Infinite Trace Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Nachum Dershowitz Cononical Sets of Horn Clauses. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus Madlener , Paliath Narendran , Friedrich Otto A Specialized Completion Procedure for Monadic String-Rewriting Systems Presenting Groups. [Citation Graph (0, 0)][DBLP ] Conf ] Pierre-Louis Curien , Roberto Di Cosmo A Concluent Reduction for the Lambda-Calculus with Surjective Pairing and Terminal Object. [Citation Graph (0, 0)][DBLP ] Conf ] Tim Fernando Provably Recursive Programs and Program Extraction. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas Lengauer , Dirk Theune Efficient Algorithms for Path Problems with Gernal Cost Citeria. [Citation Graph (0, 0)][DBLP ] Conf ] Hristo Djidjev , Grammati E. Pantziou , Christos D. Zaroliagis Computing Shortest Paths and Distances in Planar Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Zvi Galil , Giuseppe F. Italiano Maintaining Biconnected Components of Dynamic Planar Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Loebl Efficient Maximal Cubic Graph Cuts (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Uzi Vishkin Strutural Parallel Algorithmics. [Citation Graph (0, 0)][DBLP ] Conf ] Desh Ranjan , Suresh Chari , Pankaj Rohatgi Improving Known Solutions is Hard. [Citation Graph (0, 0)][DBLP ] Conf ] Lane A. Hemachandra , Albrecht Hoene Collapsing Degrees via Strong Computation (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Torben Hagerup Fast Parallel Generation of Random Permutations. [Citation Graph (0, 0)][DBLP ] Conf ] Hermann Jung , Maria J. Serna , Paul G. Spirakis A Parallel Algorithm for Two Processors Precedence Constraint Scheduling. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Fürer An Efficient NC Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Wolfgang Thomas On Logics, Tilings, and Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Jean-Pierre Jouannaud , Mitsuhiro Okada Satisfiability of Systems of Ordinal Notations with the Subterm Property is Decidable. [Citation Graph (0, 0)][DBLP ] Conf ] Hubert Comon Complete Axiomatizations of Some Quotient Term Algebras. [Citation Graph (0, 0)][DBLP ] Conf ] Roland N. Bol , Jan Friso Groote The Meaning of Negative Premises in Transition System Specifications. [Citation Graph (0, 0)][DBLP ] Conf ] Walter Vogler Deciding History Preserving Bisimilarity. [Citation Graph (0, 0)][DBLP ] Conf ] Luca Aceto , Matthew Hennessy Adding Action Refinement to a Finite Process Algebra. [Citation Graph (0, 0)][DBLP ] Conf ] Dario Bini , Luca Gemignani , Victor Y. Pan Improved Parallel Computations with Matrices and Polynomials. [Citation Graph (0, 0)][DBLP ] Conf ] Jens Lagergren , Stefan Arnborg Finding Minimal Forbidden Minors Using a Finite Congruence. [Citation Graph (0, 0)][DBLP ] Conf ] Hans L. Bodlaender , Ton Kloks Better Algorithms for the Pathwidth and Treewidth of Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Felipe Cucker , A. Torrecillas Two P-Complete Problems in the Theory of the Reals. [Citation Graph (0, 0)][DBLP ] Conf ] Juha Honkala , Arto Salomaa L Morphisms: Bounded Delay and Regularity of Ambiguity. [Citation Graph (0, 0)][DBLP ] Conf ] Véronique Bruyère , Clelia de Felice Degree and Decomposability of Variable-Length Codes. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas Wilke An Eilenberg Theorem for Infinity-Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Karel Culik II , Simant Dube Balancing Order and Chaos in Image Generation (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Yuri Gurevich Average Case Complexity. [Citation Graph (0, 0)][DBLP ] Conf ] Tao Jiang , Bala Ravikumar Minimal NFA Problems Are Hard. [Citation Graph (0, 0)][DBLP ] Conf ] Kosaburo Hashiguchi Algorithms for Determining the Smallest Number of Nonterminals (States) Sufficient for Generating (Accepting) a Regular Language. [Citation Graph (0, 0)][DBLP ] Conf ] Binay K. Bhattacharya , Godfried T. Toussaint Computing Shortest Transversals. [Citation Graph (0, 0)][DBLP ] Conf ] Bernard Chazelle , Herbert Edelsbrunner , Michelangelo Grigni , Leonidas J. Guibas , John Hershberger , Micha Sharir , Jack Snoeyink Ray Shooting in Polygons Using Geodesic Triangulations. [Citation Graph (0, 0)][DBLP ] Conf ] Marshall W. Bern , David Eppstein , F. Frances Yao The Expected Extremes in a Delaunay Triangulation. [Citation Graph (0, 0)][DBLP ] Conf ] Bernard Chazelle Computational Geometry for the Gourmet: Old Fare and New Dishes. [Citation Graph (0, 0)][DBLP ] Conf ] Pavol Duris , Zvi Galil On the Power of Multiple Reads in a Chip. [Citation Graph (0, 0)][DBLP ] Conf ] Hans Dietmar Gröger , György Turán On Linear Decision Trees Computing Boolean Functions. [Citation Graph (0, 0)][DBLP ] Conf ] Zvi Galil , Oded Margalit An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Samir Khuller , Stephen G. Mitchell , Vijay V. Vazirani On-Line Algorithms for Weighted Bipartite Matching and Stable Marriages. [Citation Graph (0, 0)][DBLP ] Conf ] Moni Naor String Matching with Preprocessing of Text and Pattern. [Citation Graph (0, 0)][DBLP ] Conf ] R. Ravi , Ajit Agrawal , Philip N. Klein Ordering Problems Approximated: Single-Processor Scheduling and Interval Graph Completion. [Citation Graph (0, 0)][DBLP ] Conf ] 