The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Thomas Eiter, Georg Gottlob
    The Complexity Class Theta2p: Recent Results and Applications in AI and Modal Logic. [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:1-18 [Conf]
  2. Rolf Hennicker, Martin Wirsing
    Proof Systems for Struvtured Algebraic Specifications: An Overview. [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:19-37 [Conf]
  3. Ming Li, Paul M. B. Vitányi
    Average-Case Analysis via Incompressibility. [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:38-50 [Conf]
  4. Antoni W. Mazurkiewicz
    Locally Computable Enumerations. [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:51-66 [Conf]
  5. Daniel A. Spielman
    The Complexity of Error-Correcting Codes. [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:67-84 [Conf]
  6. Eli Upfal
    Stochastic Analysis of Dynamic Processes. [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:85-92 [Conf]
  7. Alfons Avermiddig, Manfred Kunde, Andre Osterloh
    k-k Sorting on the Multi-Mesh. [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:93-104 [Conf]
  8. Eike Best, Thomas Thielke
    Refinement of Coloured Petri Nets. [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:105-116 [Conf]
  9. Eric Badouel, Philippe Darondeau
    Stratified Petri Nets. [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:117-128 [Conf]
  10. Antonio Calabrese
    Distributed Acyclic Orientation of Asynchronous Networks. [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:129-137 [Conf]
  11. Christian Choffrut, Leucio Guerra
    Generalized Rational Relations and their Logical Definability. [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:138-149 [Conf]
  12. Krzysztof Ciebiera, Adam Malinowski
    A Note on Broadcasting with Linearly Bounded Transmission Faults in Constant Degree Networks. [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:150-156 [Conf]
  13. Felipe Cucker, Klaus Meer
    Logics Which Capture Complexity Classes over the Reals. [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:157-167 [Conf]
  14. Frank Drewes, Hans-Jörg Kreowski, Denis Lapoire
    Criteria to Disprove Context-Freeness of Collage Languages. [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:169-178 [Conf]
  15. Anna E. Frid
    The Subword Complexity of Fixed Points of Binary Uniform Morphisms. [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:179-187 [Conf]
  16. Leszek Gasieniec, Piotr Indyk
    Efficient Parallel Computing with Memory Faults. [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:188-197 [Conf]
  17. Damas P. Gruska
    Bounded Concurrency. [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:198-209 [Conf]
  18. Mikael Hammar, Bengt J. Nilsson
    Concerning the Time Bounds of Existing Shortest Watchman Route Algorithms. [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:210-221 [Conf]
  19. Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
    Query Order in the Polynomial Hierarchy. [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:222-232 [Conf]
  20. Ulrich Hertrampf
    Polynomial Time Machines Equipped with Word Problems over Algebraic Structures as their Acceptance Criteria. [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:233-244 [Conf]
  21. Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter
    Pattern-Matching Problems for 2-Dimensional Images Described by Finite Automata. [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:245-256 [Conf]
  22. Ulla Koppenhagen, Ernst W. Mayr
    The Complexity of the Coverability, the Containment, and the Equivalence Problems for Commutative Semigroups. [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:257-268 [Conf]
  23. Manfred Kudlek, Solomon Marcus, Alexandru Mateescu
    Contextual Grammars with Distributed Catenation and Shuffle. [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:269-280 [Conf]
  24. Armin Kühnemann
    A Two-Dimensional Hierarchy for Attributed Tree Transducers. [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:281-292 [Conf]
  25. Salvatore La Torre, Margherita Napoli, Mimmo Parente
    Synchronization of 1-Way Connected Processors. [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:293-304 [Conf]
  26. Christos Levcopoulos, Joachim Gudmundsson
    A Linear-Time Heuristic for Minimum Rectangular Coverings (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:305-316 [Conf]
  27. Irina A. Lomazova
    On Occurrence Net Semantics for Petri Nets with Contacts. [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:317-328 [Conf]
  28. Bruno Martin
    Cellular Automata Universality Revisited. [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:329-339 [Conf]
  29. Marios Mavronicolas, Nikos Papadakis
    Trade-Off Results for Connection Management. [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:340-351 [Conf]
  30. Markus E. Nebel
    On the Average Complexity of the Membership Problem for a Generalized Dyck Language. [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:352-363 [Conf]
  31. Rolf Niedermeier, Klaus Reinhardt, Peter Sanders
    Towards Optimal Locality in Mesh-Indexings. [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:364-375 [Conf]
  32. Elizaveta A. Okol'nishnikova
    On the Hierarchy of Nondeterministic Branching k-Programs. [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:376-387 [Conf]
  33. Friedrich Otto, Andrea Sattler-Klein
    FDT is Undecidable for Finitely Presented Monoids with Solvable Word Problems. [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:388-399 [Conf]
  34. H. Petersen
    The Equivalence of Pebbles and Sensing Heads for Finite Automata. [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:400-410 [Conf]
  35. Alexander Moshe Rabinovich, Boris A. Trakhtenbrot
    From Finite Automata toward Hybrid Systems (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:411-422 [Conf]
  36. Zenon Sadowski
    On an Optimal Quantified Propositional Proof System and a Complete Language for NP cap co-NP. [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:423-428 [Conf]
  37. Sven Schuierer
    Lower Bounds in On-Line Geometric Searching. [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:429-440 [Conf]
  38. Frank Stephan, Sebastiaan Terwijn
    The Complexity of Universal Text-Learners. [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:441-451 [Conf]
  39. Rakesh M. Verma
    Unique Normal Forms for Nonlinear Term Rewriting Systems: Root Overlaps. [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:452-462 [Conf]
  40. Irina Virbitskaite, Anzhelika Votintseva
    Behavioural Characterizations of Partial Order Logics. [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:463-474 [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