Conferences in DBLP
Edmund M. Clarke , Xudong Zhao Word Level Model Checking (Abstract). [Citation Graph (0, 0)][DBLP ] MFCS, 1996, pp:1- [Conf ] Volker Diekert , Anca Muscholl Code Problems on Traces. [Citation Graph (0, 0)][DBLP ] MFCS, 1996, pp:2-17 [Conf ] Alan Gibbons , Martyn Amos , David Hodgson Models of DNA Computation. [Citation Graph (0, 0)][DBLP ] MFCS, 1996, pp:18-36 [Conf ] Peter D. Mosses Theory and Practice of Action Semantics. [Citation Graph (0, 0)][DBLP ] MFCS, 1996, pp:37-61 [Conf ] Madhavan Mukund , P. S. Thiagarajan Linear Time Temporal Logics over Mazurkiewicz Traces. [Citation Graph (0, 0)][DBLP ] MFCS, 1996, pp:62-92 [Conf ] Doron Peled Partial Order Reduction: Model-Checking Using Representatives. [Citation Graph (0, 0)][DBLP ] MFCS, 1996, pp:93-112 [Conf ] Jeffrey B. Remmel Nonmonotonic Rule Systems: Foward Chaining, Constraints, and Complexity (Abstract). [Citation Graph (0, 0)][DBLP ] MFCS, 1996, pp:113- [Conf ] Donald Sannella , Andrzej Tarlecki Mind the Gap! Abstract Versus Concrete Models of Specifications. [Citation Graph (0, 0)][DBLP ] MFCS, 1996, pp:114-134 [Conf ] Jerzy Tiuryn A Sequent Calculus for Subtyping Polymorphic Types. [Citation Graph (0, 0)][DBLP ] MFCS, 1996, pp:135-155 [Conf ] Vladimir A. Uspensky Kolmogorov Complexity: Recent Research in Moscow. [Citation Graph (0, 0)][DBLP ] MFCS, 1996, pp:156-166 [Conf ] Philippe Balbiani A Modal Logic for Data Analysis. [Citation Graph (0, 0)][DBLP ] MFCS, 1996, pp:167-179 [Conf ] Gabriel Baum , Marcelo F. Frias , Armando Martin Haeberer , Pablo E. Martínez López From Specifications to Programs: A Fork-Algebraic Approach to Bridge the Gap. [Citation Graph (0, 0)][DBLP ] MFCS, 1996, pp:180-191 [Conf ] Marek A. Bednarczyk Logic of Predicates with Explicit Substitutions. [Citation Graph (0, 0)][DBLP ] MFCS, 1996, pp:192-205 [Conf ] Richard Beigel , William I. Gasarch , Martin Kummer , Timothy McNicholl , Frank Stephan On the Query Complexity of Sets. [Citation Graph (0, 0)][DBLP ] MFCS, 1996, pp:206-217 [Conf ] Viviana Bono , Michele Bugliesi , Luigi Liquori A Lambda Calculus of Incomplete Objects. [Citation Graph (0, 0)][DBLP ] MFCS, 1996, pp:218-229 [Conf ] Michele Boreale , Luca Trevisan Bisimilarity Problems Requiring Exponential Time. [Citation Graph (0, 0)][DBLP ] MFCS, 1996, pp:230-241 [Conf ] Arie de Bruin , Shan-Hwei Nienhuys-Cheng Linear Dynamic Kahn Networks Are Deterministic. [Citation Graph (0, 0)][DBLP ] MFCS, 1996, pp:242-254 [Conf ] X. Cai , Ton Kloks , C. K. Wong Shortest Path Problems with Time Constraints. [Citation Graph (0, 0)][DBLP ] MFCS, 1996, pp:255-266 [Conf ] Bogdan S. Chlebus , Artur Czumaj , Leszek Gasieniec , Miroslaw Kowaluk , Wojciech Plandowski Parallel Alternating-Direction Access Machine. [Citation Graph (0, 0)][DBLP ] MFCS, 1996, pp:267-278 [Conf ] Flavio Corradini , Marco Pistore Specification and Verification of Timed Lazy Systems. [Citation Graph (0, 0)][DBLP ] MFCS, 1996, pp:279-290 [Conf ] Stéphane Demri A Class of Information Logics with a Decidable Validity Problem. [Citation Graph (0, 0)][DBLP ] MFCS, 1996, pp:291-302 [Conf ] Anders Dessmark , Andrzej Lingas On the Power of Nonconservative PRAM. [Citation Graph (0, 0)][DBLP ] MFCS, 1996, pp:303-311 [Conf ] Bruno Durand Self-Similarity Viewed as a Local Property via Tile Sets. [Citation Graph (0, 0)][DBLP ] MFCS, 1996, pp:312-323 [Conf ] Kai Engelhardt , Willem P. de Roever Simulation of Specification Statements in Hoare Logic. [Citation Graph (0, 0)][DBLP ] MFCS, 1996, pp:324-335 [Conf ] Zoltán Ésik , Anna Labella Equational Properties of Iteration in Algebraically Complete Categories. [Citation Graph (0, 0)][DBLP ] MFCS, 1996, pp:336-347 [Conf ] Henning Fernau On Unconditional Transfer. [Citation Graph (0, 0)][DBLP ] MFCS, 1996, pp:348-359 [Conf ] Dimitris Fotakis , Paul G. Spirakis (poly(log log n), poly(log log n))-Restricted Verifiers are Unlikely to Exist for Languages in NP. [Citation Graph (0, 0)][DBLP ] MFCS, 1996, pp:360-371 [Conf ] Leszek Gasieniec , Evangelos Kranakis , Danny Krizanc , Andrzej Pelc Minimizing Congestion of Layouts for ATM Networks with Faulty Links. [Citation Graph (0, 0)][DBLP ] MFCS, 1996, pp:372-381 [Conf ] Ian Glaister , Jeffrey Shallit Polynomial Automaticity, Context-Free Languages, and Fixed Points of Morphism (Extended Abstract). [Citation Graph (0, 0)][DBLP ] MFCS, 1996, pp:382-393 [Conf ] Ursula Goltz , Heike Wehrheim Causal Testing. [Citation Graph (0, 0)][DBLP ] MFCS, 1996, pp:394-406 [Conf ] Zhenjiang Hu , Hideya Iwasaki , Masato Takeichi Construction of List Homomorphisms by Tupling and Fusion. [Citation Graph (0, 0)][DBLP ] MFCS, 1996, pp:407-418 [Conf ] Marta Z. Kwiatkowska , Gethin Norman Probabilistic Metric Semantics for a Simple Language with Recursion. [Citation Graph (0, 0)][DBLP ] MFCS, 1996, pp:419-430 [Conf ] Andrea Maggiolo-Schettini , Józef Winkowski Dynamic Graphs. [Citation Graph (0, 0)][DBLP ] MFCS, 1996, pp:431-442 [Conf ] Sabrina Mantaci , Antonio Restivo Equations on Trees. [Citation Graph (0, 0)][DBLP ] MFCS, 1996, pp:443-456 [Conf ] Enno Ohlebusch , Esko Ukkonen On the Equivalence Problem for E-Pattern Languages. [Citation Graph (0, 0)][DBLP ] MFCS, 1996, pp:457-468 [Conf ] Wieslaw Pawlowski , Pawel Paczkowski , Stefan Sokolowski Specifying and Verifying Parametric Processes. [Citation Graph (0, 0)][DBLP ] MFCS, 1996, pp:469-481 [Conf ] Regimantas Pliuskevicius On Saturation with Flexible Function Symbols. [Citation Graph (0, 0)][DBLP ] MFCS, 1996, pp:482-493 [Conf ] Carsten Rössner , Jean-Pierre Seifert Approximating Good Simultaneous Diophantine Approximations Is Almost NP-Hard. [Citation Graph (0, 0)][DBLP ] MFCS, 1996, pp:494-505 [Conf ] Patrice Séébold On the Conjugation of Standard Morphisms. [Citation Graph (0, 0)][DBLP ] MFCS, 1996, pp:506-516 [Conf ] Hui Shi A Semantic Matching Algorithm: Analysis and Implementation. [Citation Graph (0, 0)][DBLP ] MFCS, 1996, pp:517-528 [Conf ] Jop F. Sibeyn Routing on Triangles, Tori and Honeycombs. [Citation Graph (0, 0)][DBLP ] MFCS, 1996, pp:529-541 [Conf ] Pilar de la Torre , David T. Kao A Uniform Analysis of Trie Structures that Store Prefixing-Keys with Application to Doubly-Chained Prefixing-Tries. [Citation Graph (0, 0)][DBLP ] MFCS, 1996, pp:542-553 [Conf ] Axel Wabenhorst On Fairness in Terminating and Reactive Programs. [Citation Graph (0, 0)][DBLP ] MFCS, 1996, pp:554-565 [Conf ] Tomoyuki Yamakami Polynomial Time Samplable Distributions. [Citation Graph (0, 0)][DBLP ] MFCS, 1996, pp:566-578 [Conf ] Elena Zucca From Static to Dynamic Abstract Data-Types. [Citation Graph (0, 0)][DBLP ] MFCS, 1996, pp:579-590 [Conf ]