default search action
12th FCT 1999: Iasi, Romania
- Gabriel Ciobanu
, Gheorghe Paun:
Fundamentals of Computation Theory, 12th International Symposium, FCT '99, Iasi, Romania, August 30 - September 3, 1999, Proceedings. Lecture Notes in Computer Science 1684, Springer 1999, ISBN 3-540-66412-2
Invited Lectures
- Marek Karpinski:
Randomized Complexity of Linear Arrangements and Polyhedra. 1-12 - Andrea Corradini, Reiko Heckel, Ugo Montanari:
Tile Transition Systems as Structured Coalgebras. 13-38 - Arto Salomaa:
Caesar and DNA. Views on Cryptology. 39-53 - Boris A. Trakhtenbrot:
Automata and Their Interaction: Definitional Suggestions. 54-89 - Matthew Hennessy:
Axiomatising Asynchronous Process Calculi (abstract). 90
Technical Contributions
- Cristina Bazgan, Wenceslas Fernandez de la Vega:
A Polynomial Time Approximation Scheme for Dense MIN 2SAT. 91-99 - Danièle Beauquier, Anatol Slissenko:
Decidable Classes of the Verification Problem in a Timed Predicate Logic. 100-111 - Viviana Bono, Michele Bugliesi:
Interpretations of Extensible Objects and Types. 112-123 - Bernd Borchert, Lane A. Hemaspaandra, Jörg Rothe:
Restrictive Acceptance Suffices for Equivalence Problems. 124-135 - Henning Bordihn, Jürgen Dassow, György Vaszil:
Grammar Systems as Language Analyzers and Recursively Enumerable Languages. 136-147 - Gérard Boudol, Silvano Dal-Zilio
An Interpretation of Extensible Objects. 148-160 - Luca Breveglieri, Stefano Crespi-Reghizzi, Alessandra Cherubini:
Modeling Operating Systems Schedulers with Multi-Stack-Queue Grammars. 161-172 - Thomas Buchholz, Andreas Klein, Martin Kutrib
Iterative Arrays with a Wee Bit Alternation. 173-184 - Sergio Cabello, Carles Padró, Germán Sáez:
Secret Sharing Schemes with Detection of Cheaters for a General Access Structure. 185-194 - Luminita Dediu, Douglas S. Bridges:
Constructive Notes on Uniform and Locally Convex Spaces. 195-203 - H. N. de Ridder, Hans L. Bodlaender:
Graph Automorphisms with Maximal Projection Distances. 204-214 - Catalin Dima:
Kleene Theorems for Event-Clock Automata. 215-225 - Pál Dömösi, Manfred Kudlek:
Strong Iteration Lemmata for Regular, Linear, Context-Free, and Linear Indexed Languages. 226-233 - Frank Drewes:
Exponential Output Size of Top-Down Tree Transducers. 234-245 - Manfred Droste, Dietrich Kuske:
On Recognizable Languages in Divisibility Monoids. 246-257 - Cristian Ene, Traian Muntean:
Expressiveness of Point-to-Point versus Broadcast Communications. 258-268 - Jürgen Forster:
On Relative Loss Bounds in Generalized Linear Regression. 269-280 - Rudolf Freund:
Generalized P-Systems. 281-292 - Stavros Georgiades, Marios Mavronicolas
Optimal, Distributed Decision-Making: The Case of No Communication. 293-303 - Vesa Halava, Tero Harju
Generalized PCP Is Decidable for Marked Morphisms. 304-315 - Chuzo Iwamoto, Tomonobu Hatsuyama, Kenichi Morita, Katsunobu Imai:
On Time-Constructible Functions in One-Dimensional Cellular Automata. 316-326 - Laurent Juban:
Dichotomy Theorem for the Generalized Unique Satisfiability Problem. 327-337 - H. C. M. Kleijn, Rémi Morin, Brigitte Rozoy:
A General Categorical Connection between Local Event Structures and Local Traces. 338-349 - Renate Klempien-Hinrichs, Hans-Jörg Kreowski, Stefan Taubenberger:
Correct Translation of Mutually Recursive Function Systems into TOL Collage Grammars. 350-361 - Teodor Knapik, Étienne Payet:
Synchronized Product of Linear Bounded Machines. 362-373 - Roman M. Kolpakov
On Maximal Repetitions in Words. 374-385 - Dorel Lucanu:
Axiomatization of the Coherence Property for Categories of Symmetries. 386-397 - Carlos Martín-Vide, Alexandru Mateescu:
Sewing Grammars. 398-408 - Andrei Paun, Mihaela Paun:
State and Transition Complexity of Watson-Crick Finite Automata. 409-420 - Catherine Pilière:
A Confluence Result for a Typed lambda-Calculus of Exception Handling with Fixed-Point. 421-432 - Adriana Popovici, Dan Popovici:
delta-Uniformly Decidable Sets and Turing Machines. 433-440 - Klaus Reinhardt:
A Parallel Context-Free Derivation Hierarchy. 441-450 - Isabelle Ryl, Yves Roos
Generalized Synchronization Languages. 451-462 - Klaus-Dieter Schewe, Bernhard Thalheim
A Generalization of Dijkstra's Calculus to Typed Program Specifications. 463-474 - Franck Seynhaeve, Sophie Tison
Homomorphisms and Concurrent Term Rewriting. 475-487 - Jeffrey O. Shallit, Ming-wei Wang:
On Two-Sided Infinite Fixed Points of Morphisms. 488-499 - Jonathan Paul Sharp:
Tiling Multi-dimensional Arrays. 500-511 - Viorica Sofronie-Stokkermans, Karel Stokkermans:
Modeling Interaction by Sheaves and Geometric Logic. 512-523 - Holger Spakowski, Jörg Vogel:
The Operators minCh and maxCh on the Polynomial Hierarchy. 524-535 - Ludwig Staiger
The Kolmogorov Complexity of Real Numbers. 536-546 - Irina B. Virbitskaite, E. Pokozy:
A Partial Order Method for the Verification of Time Petri Nets. 547-558 - Janez Zerovnik
Deriving Formulas for Domination Numbers of Fasciagraphs and Rotagraphs. 559-568
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-10-04 20:08 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: