Conferences in DBLP
Dines Bjørner Formal Description of Programming Concepts: A Software Engineering Viewpoint. [Citation Graph (1, 0)][DBLP ] Conf ] Rod M. Burstall Electronic Category Theory. [Citation Graph (0, 0)][DBLP ] Conf ] Juris Hartmanis , Stephen R. Mahaney An Eassay about Research on Sparse NP Complete Sets. [Citation Graph (0, 0)][DBLP ] Conf ] Robert M. Keller Some Theoretical Aspects of Applicative Multiprocessing. [Citation Graph (0, 0)][DBLP ] Conf ] C. K. Wong On Some Discrete Optimization Problems in Mass Storage Systems. [Citation Graph (0, 0)][DBLP ] Conf ] William A. Wulf Abstract Data Types: A Retrospective and Prospective View. [Citation Graph (0, 0)][DBLP ] Conf ] André Arnold , Maurice Nivat Controlling Behaviours of Systems: Some Basic Concepts and some Applications. [Citation Graph (0, 0)][DBLP ] Conf ] Giorgio Ausiello , Carlo Batini , Marina Moscarini Conceptual Relations between Databases Transformed under Join and Projection. [Citation Graph (3, 0)][DBLP ] Conf ] X. Berenguer , J. Díaz The Weighted Sperner's Set Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Eike Best Proof of a Concurrent Program Finding Euler Paths. [Citation Graph (0, 0)][DBLP ] Conf ] Wolfgang Bibel A Theoretical Basis for the Systematic Proof Method. [Citation Graph (0, 0)][DBLP ] Conf ] J. Dean Brock Consistent Semantics for a Data Flow Language. [Citation Graph (0, 0)][DBLP ] Conf ] Luca Cardelli Analog Processes. [Citation Graph (0, 0)][DBLP ] Conf ] Mario Coppo An Extended Polymorphic Type System for Applicative Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Wiktor Danko A Criterion of Undecidability of Algorithmic Theories. [Citation Graph (0, 0)][DBLP ] Conf ] Pierpaolo Degano , A. Lomanto , Franco Sirovich On Finding the Optimal Access Path to Resolve a Relational Data Base Query. [Citation Graph (0, 0)][DBLP ] Conf ] Hartmut Ehrig , Hans-Jörg Kreowski , Bernd Mahr , Peter Padawitz Compound Algebraic Implementations: An Approach to Stepwise Refinement of Software Systems. [Citation Graph (0, 0)][DBLP ] Conf ] David Harel on And/Or Schemes. [Citation Graph (0, 0)][DBLP ] Conf ] Matthew Hennessy , Gordon D. Plotkin A Term Model for CCS. [Citation Graph (0, 0)][DBLP ] Conf ] Berthold Hoffmann , Ilse-R. Schiedecke A Mathematical Approach to Multi-Pass Parsing. [Citation Graph (0, 0)][DBLP ] Conf ] Ulrich L. Hupbach Abstract Implementation of Abstract Data Types. [Citation Graph (0, 0)][DBLP ] Conf ] Joseph JáJá , Janos Simon Parallel Algorithms in Graph Theory: Planarity Testing (preliminary version). [Citation Graph (0, 0)][DBLP ] Conf ] Ryszard Janicki On Atomic Nets and Concurrency Relations. [Citation Graph (0, 0)][DBLP ] Conf ] Dirk Janssens , Grzegorz Rozenberg Node-Label Controllel Graph Grammars. [Citation Graph (0, 0)][DBLP ] Conf ] Kurt Jensen A Method to Compare the Descriptive Power of Different Types of Petri Nets. [Citation Graph (0, 0)][DBLP ] Conf ] Herbert Klaeren A Simple Class of Algorithmic Specifications for Abstract Software Modules. [Citation Graph (0, 0)][DBLP ] Conf ] Norbert Kraft , Horst Wedde Inducing Patterns of Behaviour in Distributed System Parts. [Citation Graph (0, 0)][DBLP ] Conf ] Ingbert Kupka Van Wijngaarden Grammars as a Special Information Processing Model. [Citation Graph (0, 0)][DBLP ] Conf ] Yat-Sang Kwong , Derick Wood Approaches to Concurrency in B-Trees. [Citation Graph (1, 0)][DBLP ] Conf ] Burkhard Monien On a Subclass of Pseudopolynomial Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Horst Müller Decidability of Reachability in Persistent Vector Replacement Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Seiichi Okoma Generalized Heapsort. [Citation Graph (0, 0)][DBLP ] Conf ] Hiroakira Ono , Akira Nakamura Decidability Results on a Query Language for Data Bases with Incomplete Informations. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Padawitz New Results on Completeness and Consistency of Abstract Data Types. [Citation Graph (0, 0)][DBLP ] Conf ] Judea Pearl Asymptotic Complexity of Game-Searching Procedures. [Citation Graph (0, 0)][DBLP ] Conf ] Helena Rasiowa Completeness in Classical Logic of Complex Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Horst Reichel Initially-Restricting Algebraic Theories. [Citation Graph (0, 0)][DBLP ] Conf ] Wolfgang Reisig Schemes for Nonsequential Processing Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Jan Reiterman , Vera Trnková Dynamic Algebras which are not Kripke Structures. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Ruzicka Time and Space Bounds in Producing Certain Partial Orders. [Citation Graph (0, 0)][DBLP ] Conf ] Andrzej Salwicki Axioms of Algorithmic Logic Univocally Determine Semantics of Programs. [Citation Graph (0, 0)][DBLP ] Conf ] Vladimir Yu. Sazonov A Logical Approach to the Problem "P=NP?". [Citation Graph (3, 0)][DBLP ] Conf ] M. W. Shields , Peter E. Lauer Verifying Concurrent System Specification in COSY. [Citation Graph (0, 0)][DBLP ] Conf ] Joseph Sifakis Deadlocks and Livelocks in Transition Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Giora Slutzki Descriptional Complexity of Concurrent Processes (preliminary version). [Citation Graph (0, 0)][DBLP ] Conf ] Stefan Sokolowski A Uniform Approach to Applicative and Imperative Features in Programming Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Zbigniew Suraj A Resource Applocation Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Tadao Takaoka , Alistair Moffat An O(n² log log log n) Expected Time Algorithm for the all Shortest Distance Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Mars K. Valiev Decision Complexity of Variants of Propositional Dynamic Logic. [Citation Graph (0, 0)][DBLP ] Conf ] Paul M. B. Vitányi Relativized Obliviousness. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Wirsing , Manfred Broy Abstract Data Types as Lattices of Finitely Generated Models. [Citation Graph (0, 0)][DBLP ] Conf ] Jacek Witaszek The LR(k) Parser. [Citation Graph (0, 0)][DBLP ] Conf ] Hartmann J. Genrich , Kurt Lautenbach , P. S. Thiagarajan Substitution Systems - A Family of System Models Based on Concurrency. [Citation Graph (0, 0)][DBLP ] Conf ] 