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