The SCEAS System
Navigation Menu

Conferences in DBLP

Fundamentals of Computation Theory (FCT) (fct)
1999 (conf/fct/1999)

  1. Marek Karpinski
    Randomized Complexity of Linear Arrangements and Polyhedra. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:1-12 [Conf]
  2. Andrea Corradini, Reiko Heckel, Ugo Montanari
    Tile Transition Systems as Structured Coalgebras. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:13-38 [Conf]
  3. Arto Salomaa
    Caesar and DNA. Views on Cryptology. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:39-53 [Conf]
  4. Boris A. Trakhtenbrot
    Automata and Their Interaction: Definitional Suggestions. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:54-89 [Conf]
  5. Matthew Hennessy
    Axiomatising Asynchronous Process Calculi (abstract). [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:90- [Conf]
  6. Cristina Bazgan, Wenceslas Fernandez de la Vega
    A Polynomial Time Approximation Scheme for Dense MIN 2SAT. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:91-99 [Conf]
  7. Danièle Beauquier, Anatol Slissenko
    Decidable Classes of the Verification Problem in a Timed Predicate Logic. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:100-111 [Conf]
  8. Viviana Bono, Michele Bugliesi
    Interpretations of Extensible Objects and Types. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:112-123 [Conf]
  9. Bernd Borchert, Lane A. Hemaspaandra, Jörg Rothe
    Restrictive Acceptance Suffices for Equivalence Problems. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:124-135 [Conf]
  10. Henning Bordihn, Jürgen Dassow, György Vaszil
    Grammar Systems as Language Analyzers and Recursively Enumerable Languages. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:136-147 [Conf]
  11. Gérard Boudol, Silvano Dal-Zilio
    An Interpretation of Extensible Objects. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:148-160 [Conf]
  12. Luca Breveglieri, Stefano Crespi-Reghizzi, Alessandra Cherubini
    Modeling Operating Systems Schedulers with Multi-Stack-Queue Grammars. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:161-172 [Conf]
  13. Thomas Buchholz, Andreas Klein, Martin Kutrib
    Iterative Arrays with a Wee Bit Alternation. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:173-184 [Conf]
  14. Sergio Cabello, Carles Padró, Germán Sáez
    Secret Sharing Schemes with Detection of Cheaters for a General Access Structure. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:185-194 [Conf]
  15. Luminita Dediu, Douglas S. Bridges
    Constructive Notes on Uniform and Locally Convex Spaces. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:195-203 [Conf]
  16. H. N. de Ridder, Hans L. Bodlaender
    Graph Automorphisms with Maximal Projection Distances. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:204-214 [Conf]
  17. Catalin Dima
    Kleene Theorems for Event-Clock Automata. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:215-225 [Conf]
  18. Pál Dömösi, Manfred Kudlek
    Strong Iteration Lemmata for Regular, Linear, Context-Free, and Linear Indexed Languages. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:226-233 [Conf]
  19. Frank Drewes
    Exponential Output Size of Top-Down Tree Transducers. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:234-245 [Conf]
  20. Manfred Droste, Dietrich Kuske
    On Recognizable Languages in Divisibility Monoids. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:246-257 [Conf]
  21. Cristian Ene, Traian Muntean
    Expressiveness of Point-to-Point versus Broadcast Communications. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:258-268 [Conf]
  22. Jürgen Forster
    On Relative Loss Bounds in Generalized Linear Regression. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:269-280 [Conf]
  23. Rudolf Freund
    Generalized P-Systems. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:281-292 [Conf]
  24. Stavros Georgiades, Marios Mavronicolas, Paul G. Spirakis
    Optimal, Distributed Decision-Making: The Case of No Communication. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:293-303 [Conf]
  25. Vesa Halava, Tero Harju, Mika Hirvensalo
    Generalized PCP Is Decidable for Marked Morphisms. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:304-315 [Conf]
  26. Chuzo Iwamoto, Tomonobu Hatsuyama, Kenichi Morita, Katsunobu Imai
    On Time-Constructible Functions in One-Dimensional Cellular Automata. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:316-326 [Conf]
  27. Laurent Juban
    Dichotomy Theorem for the Generalized Unique Satisfiability Problem. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:327-337 [Conf]
  28. H. C. M. Kleijn, Rémi Morin, Brigitte Rozoy
    A General Categorical Connection between Local Event Structures and Local Traces. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:338-349 [Conf]
  29. Renate Klempien-Hinrichs, Hans-Jörg Kreowski, Stefan Taubenberger
    Correct Translation of Mutually Recursive Function Systems into TOL Collage Grammars. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:350-361 [Conf]
  30. Teodor Knapik, Étienne Payet
    Synchronized Product of Linear Bounded Machines. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:362-373 [Conf]
  31. Roman M. Kolpakov, Gregory Kucherov
    On Maximal Repetitions in Words. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:374-385 [Conf]
  32. Dorel Lucanu
    Axiomatization of the Coherence Property for Categories of Symmetries. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:386-397 [Conf]
  33. Carlos Martín-Vide, Alexandru Mateescu
    Sewing Grammars. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:398-408 [Conf]
  34. Andrei Paun, Mihaela Paun
    State and Transition Complexity of Watson-Crick Finite Automata. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:409-420 [Conf]
  35. Catherine Pilière
    A Confluence Result for a Typed lambda-Calculus of Exception Handling with Fixed-Point. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:421-432 [Conf]
  36. Adriana Popovici, Dan Popovici
    delta-Uniformly Decidable Sets and Turing Machines. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:433-440 [Conf]
  37. Klaus Reinhardt
    A Parallel Context-Free Derivation Hierarchy. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:441-450 [Conf]
  38. Isabelle Ryl, Yves Roos, Mireille Clerbout
    Generalized Synchronization Languages. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:451-462 [Conf]
  39. Klaus-Dieter Schewe, Bernhard Thalheim
    A Generalization of Dijkstra's Calculus to Typed Program Specifications. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:463-474 [Conf]
  40. Franck Seynhaeve, Sophie Tison, Marc Tommasi
    Homomorphisms and Concurrent Term Rewriting. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:475-487 [Conf]
  41. Jeffrey Shallit, Ming-wei Wang
    On Two-Sided Infinite Fixed Points of Morphisms. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:488-499 [Conf]
  42. Jonathan P. Sharp
    Tiling Multi-dimensional Arrays. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:500-511 [Conf]
  43. Viorica Sofronie-Stokkermans, Karel Stokkermans
    Modeling Interaction by Sheaves and Geometric Logic. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:512-523 [Conf]
  44. Holger Spakowski, Jörg Vogel
    The Operators minCh and maxCh on the Polynomial Hierarchy. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:524-535 [Conf]
  45. Ludwig Staiger
    The Kolmogorov Complexity of Real Numbers. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:536-546 [Conf]
  46. Irina Virbitskaite, E. Pokozy
    A Partial Order Method for the Verification of Time Petri Nets. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:547-558 [Conf]
  47. Janez Zerovnik
    Deriving Formulas for Domination Numbers of Fasciagraphs and Rotagraphs. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:559-568 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002