- 1999
- Cristina Bazgan, Wenceslas Fernandez de la Vega:
A Polynomial Time Approximation Scheme for Dense MIN 2SAT. FCT 1999: 91-99 - Danièle Beauquier, Anatol Slissenko:
Decidable Classes of the Verification Problem in a Timed Predicate Logic. FCT 1999: 100-111 - Viviana Bono, Michele Bugliesi:
Interpretations of Extensible Objects and Types. FCT 1999: 112-123 - Bernd Borchert, Lane A. Hemaspaandra, Jörg Rothe:
Restrictive Acceptance Suffices for Equivalence Problems. FCT 1999: 124-135 - Henning Bordihn, Jürgen Dassow, György Vaszil:
Grammar Systems as Language Analyzers and Recursively Enumerable Languages. FCT 1999: 136-147 - Gérard Boudol, Silvano Dal-Zilio:
An Interpretation of Extensible Objects. FCT 1999: 148-160 - Luca Breveglieri, Stefano Crespi-Reghizzi, Alessandra Cherubini:
Modeling Operating Systems Schedulers with Multi-Stack-Queue Grammars. FCT 1999: 161-172 - Thomas Buchholz, Andreas Klein, Martin Kutrib:
Iterative Arrays with a Wee Bit Alternation. FCT 1999: 173-184 - Sergio Cabello, Carles Padró, Germán Sáez:
Secret Sharing Schemes with Detection of Cheaters for a General Access Structure. FCT 1999: 185-194 - Andrea Corradini, Reiko Heckel, Ugo Montanari:
Tile Transition Systems as Structured Coalgebras. FCT 1999: 13-38 - Luminita Dediu, Douglas S. Bridges:
Constructive Notes on Uniform and Locally Convex Spaces. FCT 1999: 195-203 - Catalin Dima:
Kleene Theorems for Event-Clock Automata. FCT 1999: 215-225 - Pál Dömösi, Manfred Kudlek:
Strong Iteration Lemmata for Regular, Linear, Context-Free, and Linear Indexed Languages. FCT 1999: 226-233 - Frank Drewes:
Exponential Output Size of Top-Down Tree Transducers. FCT 1999: 234-245 - Manfred Droste, Dietrich Kuske:
On Recognizable Languages in Divisibility Monoids. FCT 1999: 246-257 - Cristian Ene, Traian Muntean:
Expressiveness of Point-to-Point versus Broadcast Communications. FCT 1999: 258-268 - Jürgen Forster:
On Relative Loss Bounds in Generalized Linear Regression. FCT 1999: 269-280 - Rudolf Freund:
Generalized P-Systems. FCT 1999: 281-292 - Stavros Georgiades, Marios Mavronicolas, Paul G. Spirakis:
Optimal, Distributed Decision-Making: The Case of No Communication. FCT 1999: 293-303 - Vesa Halava, Tero Harju, Mika Hirvensalo:
Generalized PCP Is Decidable for Marked Morphisms. FCT 1999: 304-315 - Matthew Hennessy:
Axiomatising Asynchronous Process Calculi (abstract). FCT 1999: 90 - Chuzo Iwamoto, Tomonobu Hatsuyama, Kenichi Morita, Katsunobu Imai:
On Time-Constructible Functions in One-Dimensional Cellular Automata. FCT 1999: 316-326 - Laurent Juban:
Dichotomy Theorem for the Generalized Unique Satisfiability Problem. FCT 1999: 327-337 - Marek Karpinski:
Randomized Complexity of Linear Arrangements and Polyhedra. FCT 1999: 1-12 - H. C. M. Kleijn, Rémi Morin, Brigitte Rozoy:
A General Categorical Connection between Local Event Structures and Local Traces. FCT 1999: 338-349 - Renate Klempien-Hinrichs, Hans-Jörg Kreowski, Stefan Taubenberger:
Correct Translation of Mutually Recursive Function Systems into TOL Collage Grammars. FCT 1999: 350-361 - Teodor Knapik, Étienne Payet:
Synchronized Product of Linear Bounded Machines. FCT 1999: 362-373 - Roman M. Kolpakov, Gregory Kucherov:
On Maximal Repetitions in Words. FCT 1999: 374-385 - Dorel Lucanu:
Axiomatization of the Coherence Property for Categories of Symmetries. FCT 1999: 386-397 - Carlos Martín-Vide, Alexandru Mateescu:
Sewing Grammars. FCT 1999: 398-408