default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID4th FCT 1983: Borgholm, Sweden
- Marek Karpinski:
Fundamentals of Computation Theory, Proceedings of the 1983 International FCT-Conference, Borgholm, Sweden, August 21-27, 1983. Lecture Notes in Computer Science 158, Springer 1983, ISBN 3-540-12689-9 - Samson Abramsky
:
Experiments, Powerdomains and Fully Abstract Models for Applicative Multiprogramming. 1-13 - Piotr Berman:
Deterministic Dynamic Logic of Recursive Programs is Weaker than Dynamic Logic. 14-25 - Andreas Brandstädt, Klaus W. Wagner:
Reversal-Bounded and Visit-Bounded Realtime Computations. 26-39 - Burchard von Braunmühl, Rutger Verbeek:
Input-Driven Languages are Recognized in log n Space. 40-51 - Bernard Chazelle:
How to Search in History. 52-63 - Robert L. Constable:
Constructive Mathematics as a Programming Logic I: Some Principles of Theory. 64-77 - Stephen A. Cook:
The Classifikation of Problems which have Fast Parallel Algorithms. 78-93 - Gerardo Costa, Colin Stirling:
A Fair Calculus of Communicating Systems. 94-105 - Karel Culík II, Emo Welzl:
Two Way Finite State Generators. 106-114 - Rocco De Nicola:
A Complete Set of Axioms for a Theory of Communicating Sequential Processes. 115-126 - Michael J. Fischer:
The Consensus Problem in Unreliable Distributed Systems (A Brief Survey). 127-140 - Philippe Flajolet:
Methods in the Analysis of Algorithms: Evaluations of a Recursive Partitioning Process. 141-158 - Rusins Freivalds:
Space and Reversal Complexity of Probabilistic One-Way Turing Machines. 159-170 - Merrick L. Furst, Richard J. Lipton, Larry J. Stockmeyer:
Pseudorandom Number Generation and Space Complexity. 171-176 - David Harel:
Recurring Dominoes: Making the Highly Undecidable Highly Understandable (Preliminary Report). 177-194 - David Harel, Rivi Sherman:
Propositional Dynamic Logic of Flowcharts. 195-206 - Stefan Hertel, Kurt Mehlhorn:
Fast Triangulation of Simple Polygons. 207-218 - Yair Itzhaik, Amiram Yehudai:
On Containment Problems for Finite-Turn Languages (Extended Abstract). 219-231 - Ladislav Janiga, Václav Koubek:
On Languages Generated by Semigroups. 232-240 - Hans Langmaack:
Apects of Programs With Finite Modes. 241-254 - Frank Thomson Leighton, Ronald L. Rivest:
Estimating a Probability Using Finite Memory (Extended Abstract). 255-269 - 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. 270-284 - Angus Macintyre:
Decision Problems for Exponential Rings: The p-adic case. 285-289 - Michael G. Main, David B. Benson:
Functional Behaviour of Nondeterministic Programs. 290-301 - Kurt Mehlhorn, Bernd H. Schmidt:
A Single Shortest Path Algorithm for Graphs with Separators. 302-309 - Gary L. Miller:
Isomorphism Testing and Canonical Forms for k-Contractable Graphs (A Generalization of Bounded Valence and Bounded Genus). 310-327 - Renata Ochranová:
Finding Dominators. 328-334 - Fernando Orejas:
Characterizing Composability of Abstract Implementations. 335-346 - Rohit Parikh:
Propositional Logics of Programs: New Directions. 347-359 - Marco Protasi, Maurizio Talamo:
A New Probabilistic Model for the Study of Algorithmic Properties of Random Graph Problems. 360-367 - Kenneth W. Regan:
On Diagonalization Methods and the Structure of Language Classes. 368-380 - Rüdiger Reischuk:
A New Solution for the Byzantine Generals Problem (Extended Abstract). 382-393 - Dieter Rödding:
Modular Decompostion of Automata (Survey). 394-412 - Donald Sannella, Martin Wirsing:
A Kernel Language for Algebraic Specification and Implementation - Extended Abstract. 413-427 - Eli Shamir, Eli Upfal:
A Fast Construction oF Disjoint Paths in Communication Networks. 428-438 - Hans Ulrich Simon:
A Tight Omega(loglog n)-Bound on the Time for Parallel Ram's to Compute Nondegenerated Boolean Functions. 439-444 - Jan M. Smith:
The Identification of Propositions and types in Martin-Löf's Type Theory: A Programming Example. 445-456 - Andrzej Szepietowski:
Remarks on Searching Labyrinths by Automata. 457-464 - Sophie Tison, Max Dauchet, Gérard Comyn:
Metrical an Ordered Properties of Powerdomains. 465-474 - Peter Drum, Detlef Wotschke:
Economy of Description for Program Schemes -Extended Abstract-. 475-486 - Esko Ukkonen:
On Approximate String Matching. 487-495 - Pawel Urzyczyn:
Deterministic Context-Free Dynamic Logic is More Expressive than Deterministic Dynamic Logic of Regular Programs. 498-504 - Glynn Winskel:
A Note on Powerdomains and Modalitiy. 505-514 - David Michael Ritchie Park:
Reasoning with Fairness Constraints. 516-517
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-09-25 00:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
