Conferences in DBLP
Samson Abramsky Experiments, Powerdomains and Fully Abstract Models for Applicative Multiprogramming. [Citation Graph (0, 0)][DBLP ] FCT, 1983, pp:1-13 [Conf ] Piotr Berman Deterministic Dynamic Logic of Recursive Programs is Weaker than Dynamic Logic. [Citation Graph (0, 0)][DBLP ] FCT, 1983, pp:14-25 [Conf ] Andreas Brandstädt , Klaus W. Wagner Reversal-Bounded and Visit-Bounded Realtime Computations. [Citation Graph (0, 0)][DBLP ] FCT, 1983, pp:26-39 [Conf ] Burchard von Braunmühl , Rutger Verbeek Input-Driven Languages are Recognized in log n Space. [Citation Graph (0, 0)][DBLP ] FCT, 1983, pp:40-51 [Conf ] Bernard Chazelle How to Search in History. [Citation Graph (0, 0)][DBLP ] FCT, 1983, pp:52-63 [Conf ] Robert L. Constable Constructive Mathematics as a Programming Logic I: Some Principles of Theory. [Citation Graph (0, 0)][DBLP ] FCT, 1983, pp:64-77 [Conf ] Stephen A. Cook The Classifikation of Problems which have Fast Parallel Algorithms. [Citation Graph (0, 0)][DBLP ] FCT, 1983, pp:78-93 [Conf ] Gerardo Costa , Colin Stirling A Fair Calculus of Communicating Systems. [Citation Graph (0, 0)][DBLP ] FCT, 1983, pp:94-105 [Conf ] Karel Culik II , Emo Welzl Two Way Finite State Generators. [Citation Graph (0, 0)][DBLP ] FCT, 1983, pp:106-114 [Conf ] Rocco De Nicola A Complete Set of Axioms for a Theory of Communicating Sequential Processes. [Citation Graph (0, 0)][DBLP ] FCT, 1983, pp:115-126 [Conf ] Michael J. Fischer The Consensus Problem in Unreliable Distributed Systems (A Brief Survey). [Citation Graph (1, 0)][DBLP ] FCT, 1983, pp:127-140 [Conf ] Philippe Flajolet Methods in the Analysis of Algorithms: Evaluations of a Recursive Partitioning Process. [Citation Graph (0, 0)][DBLP ] FCT, 1983, pp:141-158 [Conf ] Rusins Freivalds Space and Reversal Complexity of Probabilistic One-Way Turing Machines. [Citation Graph (0, 0)][DBLP ] FCT, 1983, pp:159-170 [Conf ] Merrick L. Furst , Richard J. Lipton , Larry J. Stockmeyer Pseudorandom Number Generation and Space Complexity. [Citation Graph (0, 0)][DBLP ] FCT, 1983, pp:171-176 [Conf ] David Harel Recurring Dominoes: Making the Highly Undecidable Highly Understandable (Preliminary Report). [Citation Graph (0, 0)][DBLP ] FCT, 1983, pp:177-194 [Conf ] David Harel , Rivi Sherman Propositional Dynamic Logic of Flowcharts. [Citation Graph (0, 0)][DBLP ] FCT, 1983, pp:195-206 [Conf ] Stefan Hertel , Kurt Mehlhorn Fast Triangulation of Simple Polygons. [Citation Graph (2, 0)][DBLP ] FCT, 1983, pp:207-218 [Conf ] Yair Itzhaik , Amiram Yehudai On Containment Problems for Finite-Turn Languages (Extended Abstract). [Citation Graph (0, 0)][DBLP ] FCT, 1983, pp:219-231 [Conf ] Ladislav Janiga , Václav Koubek On Languages Generated by Semigroups. [Citation Graph (0, 0)][DBLP ] FCT, 1983, pp:232-240 [Conf ] Hans Langmaack Apects of Programs With Finite Modes. [Citation Graph (0, 0)][DBLP ] FCT, 1983, pp:241-254 [Conf ] Frank Thomson Leighton , Ronald L. Rivest Estimating a Probability Using Finite Memory (Extended Abstract). [Citation Graph (0, 0)][DBLP ] FCT, 1983, pp:255-269 [Conf ] Andrzej Lingas The Greedy and Delauney Triangulations are not Bad in the Average Case and Minimum Weight Geometric Triangulation of Multi-Connected Polygons is NP-Complete. [Citation Graph (0, 0)][DBLP ] FCT, 1983, pp:270-284 [Conf ] Angus Macintyre Decision Problems for Exponential Rings: The p-adic case. [Citation Graph (0, 0)][DBLP ] FCT, 1983, pp:285-289 [Conf ] Michael G. Main , David B. Benson Functional Behaviour of Nondeterministic Programs. [Citation Graph (0, 0)][DBLP ] FCT, 1983, pp:290-301 [Conf ] Kurt Mehlhorn , Bernd H. Schmidt A Single Shortest Path Algorithm for Graphs with Separators. [Citation Graph (0, 0)][DBLP ] FCT, 1983, pp:302-309 [Conf ] Gary L. Miller Isomorphism Testing and Canonical Forms for k-Contractable Graphs (A Generalization of Bounded Valence and Bounded Genus). [Citation Graph (0, 0)][DBLP ] FCT, 1983, pp:310-327 [Conf ] Renata Ochranová Finding Dominators. [Citation Graph (0, 0)][DBLP ] FCT, 1983, pp:328-334 [Conf ] Fernando Orejas Characterizing Composability of Abstract Implementations. [Citation Graph (0, 0)][DBLP ] FCT, 1983, pp:335-346 [Conf ] Rohit Parikh Propositional Logics of Programs: New Directions. [Citation Graph (0, 0)][DBLP ] FCT, 1983, pp:347-359 [Conf ] Marco Protasi , Maurizio Talamo A New Probabilistic Model for the Study of Algorithmic Properties of Random Graph Problems. [Citation Graph (0, 0)][DBLP ] FCT, 1983, pp:360-367 [Conf ] Kenneth W. Regan On Diagonalization Methods and the Structure of Language Classes. [Citation Graph (0, 0)][DBLP ] FCT, 1983, pp:368-380 [Conf ] Rüdiger Reischuk A New Solution for the Byzantine Generals Problem (Extended Abstract). [Citation Graph (0, 0)][DBLP ] FCT, 1983, pp:382-393 [Conf ] Dieter Rödding Modular Decompostion of Automata (Survey). [Citation Graph (0, 0)][DBLP ] FCT, 1983, pp:394-412 [Conf ] Donald Sannella , Martin Wirsing A Kernel Language for Algebraic Specification and Implementation - Extended Abstract. [Citation Graph (1, 0)][DBLP ] FCT, 1983, pp:413-427 [Conf ] Eli Shamir , Eli Upfal A Fast Construction oF Disjoint Paths in Communication Networks. [Citation Graph (0, 0)][DBLP ] FCT, 1983, pp:428-438 [Conf ] Hans-Ulrich Simon A Tight Omega(loglog n)-Bound on the Time for Parallel Ram's to Compute Nondegenerated Boolean Functions. [Citation Graph (0, 0)][DBLP ] FCT, 1983, pp:439-444 [Conf ] Jan M. Smith The Identification of Propositions and types in Martin-Löf's Type Theory: A Programming Example. [Citation Graph (0, 0)][DBLP ] FCT, 1983, pp:445-456 [Conf ] Andrzej Szepietowski Remarks on Searching Labyrinths by Automata. [Citation Graph (0, 0)][DBLP ] FCT, 1983, pp:457-464 [Conf ] Sophie Tison , Max Dauchet , Gérard Comyn Metrical an Ordered Properties of Powerdomains. [Citation Graph (0, 0)][DBLP ] FCT, 1983, pp:465-474 [Conf ] Peter Drum , Detlef Wotschke Economy of Description for Program Schemes -Extended Abstract-. [Citation Graph (0, 0)][DBLP ] FCT, 1983, pp:475-486 [Conf ] Esko Ukkonen On Approximate String Matching. [Citation Graph (0, 0)][DBLP ] FCT, 1983, pp:487-495 [Conf ] Pawel Urzyczyn Deterministic Context-Free Dynamic Logic is More Expressive than Deterministic Dynamic Logic of Regular Programs. [Citation Graph (0, 0)][DBLP ] FCT, 1983, pp:498-504 [Conf ] Glynn Winskel A Note on Powerdomains and Modalitiy. [Citation Graph (0, 0)][DBLP ] FCT, 1983, pp:505-514 [Conf ] David Park Reasoning with Fairness Constraints. [Citation Graph (0, 0)][DBLP ] FCT, 1983, pp:516-517 [Conf ]