The SCEAS System
Navigation Menu

Conferences in DBLP

Mathematical Foundations of Computer Science (MFCS) (mfcs)
1992 (conf/mfcs/1992)

  1. Pankaj K. Agarwal, Jirí Matousek
    On Range Searching with Semialgebraic Sets. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:1-13 [Conf]
  2. Josep Díaz
    Graph Layout Problems. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:14-23 [Conf]
  3. Klaus-Jörn Lange, Peter Rossmanith, Wojciech Rytter
    Parallel Recognition and Ranking of Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:24-36 [Conf]
  4. Milena Mihail
    On the Expansion of Combinatorial Polytopes. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:37-49 [Conf]
  5. Pekka Orponen
    Neural Networks and Complexity Theory. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:50-61 [Conf]
  6. J. V. Tucker, Jeffery I. Zucker
    Theory of Computation over Stream Algebras, and its Applications. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:62-80 [Conf]
  7. Uzi Vishkin
    Methods in Parallel Algorithmics (Abstract). [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:81- [Conf]
  8. Osamu Watanabe
    On the Complexity of Small Description and Related Topics. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:82-94 [Conf]
  9. Juraj Wiedermann
    Weak Parallel Machines: a New Class of Physically Feasible Parallel Machine Models. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:95-111 [Conf]
  10. Avi Wigderson
    The Complexity of Graph Connectivity. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:112-132 [Conf]
  11. Holger Bast, Martin Dietzfelbinger, Torben Hagerup
    A Perfect Parallel Dictionary. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:133-141 [Conf]
  12. Bernd Becker, Joachim Hartmann
    Some Remarks on the Test Complexity of Iterative Logic Arrays. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:142-152 [Conf]
  13. Hans-Jörg Burtschick, Albrecht Hoene
    The Degree Structure of 1-L Reductions. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:153-161 [Conf]
  14. Jin-yi Cai, Lane A. Hemachandra, Jozef Vyskoc
    Promise Problems and Access to Unambiguous Computation. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:162-171 [Conf]
  15. Suresh Chari, Desh Ranjan, Pankaj Rohatgi
    On the Complexity of Incremental Computation. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:172-180 [Conf]
  16. Christian Choffrut, Massimiliano Goldwurm
    Rational Transductions and Complexity of Counting Problems. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:181-190 [Conf]
  17. Hubert Comon, Maribel Fernández
    Negation Elimination in Equational Formulae. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:191-199 [Conf]
  18. José Félix Costa, Amílcar Sernadas, Cristina Sernadas, Hans-Dieter Ehrich
    Object Interaction. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:200-208 [Conf]
  19. Pierre-Louis Curien, Thérèse Hardin, Alejandro Ríos
    Strong Normalization of Substitutions. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:209-217 [Conf]
  20. Robert P. Daley, Bala Kalyanasundaram
    Probabilistic and Pluralistic Learners with Mind Changes. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:218-226 [Conf]
  21. Carsten Damm, Markus Holzer, Klaus-Jörn Lange
    Parallel Complexity of Iterated Morphisms and the Arithmetic of Small Numbers. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:227-235 [Conf]
  22. Denis Derencourt, Juhani Karhumäki, Michel Latteux, Alain Terlutte
    On Computational Power of Weighted Finite Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:236-245 [Conf]
  23. Rainer Feldmann, Peter Mysliwietz
    The Shuffle Exchange Network has a Hamiltonian Path. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:246-254 [Conf]
  24. Paul Gastin, Antoine Petit
    Poset Properties of Complex Traces. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:255-263 [Conf]
  25. Andreas Goerdt
    A Threshold for Unsatisfiability. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:264-274 [Conf]
  26. Robert Gold
    Dataflow Semantics for Petri Nets. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:275-283 [Conf]
  27. Irène Guessarian, Marcos Veloso Peixoto
    About Boundedness for some DATALOG and DATALOG_neg Programs. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:284-297 [Conf]
  28. Torben Hagerup, Ola Petersson
    Merging and Sorting Strings in Parallel. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:298-306 [Conf]
  29. Petr Jancar, Frantisek Mráz, Martin Plátek
    Characterization of Context-Free Languages by Erasing Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:307-314 [Conf]
  30. Lila Kari
    Insertion and Deletion of Words: Determinism and Reversibility. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:315-326 [Conf]
  31. Frantisek Kascak
    Small Universal One-State Linear Operator Algorithm. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:327-335 [Conf]
  32. Cosimo Laneve, Ugo Montanari
    Mobility in the CC-Paradigm. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:336-345 [Conf]
  33. Klaus-Jörn Lange, Peter Rossmanith
    The Emptiness Problem for Intersections of Regular Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:346-354 [Conf]
  34. Hing Leung
    On Finite Automata with Limited Nondeterminism. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:355-363 [Conf]
  35. Igor Litovsky, Yves Métivier, Eric Sopena
    Definitions and Comparisons of Local Computations on Graphs. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:364-373 [Conf]
  36. Bruno Martin
    Efficient Unidimensional Universal Cellular Automaton. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:374-382 [Conf]
  37. Osamu Maruyama, Satoru Miyano
    Inferring a Tree from Walks. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:383-391 [Conf]
  38. Elvira Mayordomo
    Almost Every Set in Exponential Time is P-Bi-Immune. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:392-400 [Conf]
  39. David Murphy, Axel Poigné
    A Functorial Semantics for Observed Concurrency. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:401-411 [Conf]
  40. Edward Ochmanski
    Modelling Concurrency with Semi-Commutations. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:412-420 [Conf]
  41. John Pedersen
    Decision Problems for Cellular Automata and Their Semigroups. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:421-429 [Conf]
  42. G. Michele Pinna, Axel Poigné
    On the Nature of Events. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:430-441 [Conf]
  43. W. Preilowski, Elias Dahlhaus, Gerd Wechsung
    New Parallel Algorithms for Convex Hull and Triangulation in 3-Dimensional Space. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:442-450 [Conf]
  44. Teodor C. Przymusinski
    Two Simple Characterizations of Well-Founded Semantics. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:451-462 [Conf]
  45. S. Ramesh
    Fully Abstract Semantics for Higher Order Communicating Systems. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:463-471 [Conf]
  46. Nicolas Reimen
    Superposable Trellis Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:472-482 [Conf]
  47. Thomas Roos, Gerhard Albers
    Maintaining Proximity in Higher Dimensional Spaces. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:483-493 [Conf]
  48. Andrew Szilard, Sheng Yu, Kaizhong Zhang, Jeffrey Shallit
    Characterizing Regular Languages with Polynomial Densities. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:494-503 [Conf]
  49. Dongming Wang
    A Strategy for Speeding-up the Computation of Characteristic Sets. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:504-510 [Conf]
  50. Celia Wrathall, Volker Diekert, Friedrich Otto
    One-Rule Trace-Rewriting Systems and Confluence. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:511-521 [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