The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Krzysztof R. Apt, Sandro Etalle
    On the Unification Free Prolog Programs. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:1-19 [Conf]
  2. André Arnold, Anne Dicky
    Equivalences and Preorders of Transition Systems. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:20-31 [Conf]
  3. James McKinna, Rod M. Burstall
    Deliverables: A Categorial Approach to Program Development in Type Theory. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:32-67 [Conf]
  4. Volker Diekert
    Complex and Complex-Like Traces. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:68-82 [Conf]
  5. Matthew Hennessy
    Symbolic Bisimulations (Abstract). [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:83- [Conf]
  6. Furio Honsell, Marina Lenisa
    Some Results on the Full Abstraction Problem for Restricted Lambda Calculi. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:84-104 [Conf]
  7. Robin Milner
    Action Calculi, or Syntactic Action Structures. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:105-121 [Conf]
  8. Andrew M. Pitts, Ian D. B. Stark
    Observable Properties of Higher Order Functions that Dynamically Create Local Names, or What's new? [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:122-141 [Conf]
  9. Vaughan R. Pratt
    The Second Calculus of Binary Relations. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:142-155 [Conf]
  10. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    An Introduction to Dynamic Labled 2-Structures. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:156-173 [Conf]
  11. Alexandru Mateescu, Arto Salomaa
    Post Correspondence Problem: Primitivity and Interrelations with Complexity Classes. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:174-184 [Conf]
  12. Philip Wadler
    A Taste of Linear Logic. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:185-210 [Conf]
  13. Laurent Alonso, René Schott
    On the Tree Inclusion Problem. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:211-221 [Conf]
  14. Roberto M. Amadio
    On the Adequacy of Per Models. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:222-231 [Conf]
  15. Vikraman Arvind, Johannes Köbler, Martin Mundhenk
    Hausdorff Reductions to Sparse Sets and to Sets of High Information Content. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:232-241 [Conf]
  16. Egidio Astesiano, Gianna Reggio, Elena Zucca
    Stores as Homomorphisms and their Transformations. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:242-251 [Conf]
  17. J. W. de Bakker, Franck van Breugel, Arie de Bruin
    Comparative Semantics for Linear Arrays of Communicating Processes: A Study of the UNIX Fork and Pipe Commands. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:252-261 [Conf]
  18. Danièle Beauquier, Andreas Podelski
    Rabin Tree Automata and Finite Monoids. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:262-271 [Conf]
  19. Marcin Benke
    Efficient Type Reconstruction in the Presence of Inheritance. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:272-280 [Conf]
  20. Jean Berstel, Patrice Séébold
    A Characterization of Sturmian Morphisms. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:281-290 [Conf]
  21. Hans L. Bodlaender, Klaus Jansen
    On the Complexity of Scheduling Incompatible Jobs with Unit-Times. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:291-300 [Conf]
  22. Marcello M. Bonsangue, Joost N. Kok
    Isomorphisms between Predicates and State Transformers. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:301-310 [Conf]
  23. Liming Cai, Jianer Chen
    On the Amount of Nondeterminism and the Power of Verifying (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:311-320 [Conf]
  24. Ilaria Castellani
    Observing Distribution in Processes. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:321-331 [Conf]
  25. Christophe Cérin, Antoine Petit
    Speedup of Recognizable Trace Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:332-341 [Conf]
  26. Maura Cerioli, José Meseguer
    May I Borrow Your Logic? [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:342-351 [Conf]
  27. Shiva Chaudhuri, Torben Hagerup, Rajeev Raman
    Approximate and Exact Deterministic Parallel Selection. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:352-361 [Conf]
  28. Jian Chen, John Staples
    Defining Soft Sortedness by Abstract Interpretation. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:362-371 [Conf]
  29. Liang Chen
    A Model for Real-Time Process Algebras (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:372-381 [Conf]
  30. José Félix Costa, Amílcar Sernadas, Cristina Sernadas
    Data Encapsulation and Modularity: Three Views of Inheritance. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:382-391 [Conf]
  31. Karel Culik II, Jarkko Kari
    Image Compression Using Weighted Finite Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:392-402 [Conf]
  32. Mariangiola Dezani-Ciancaglini, Ugo de'Liguoro, Adolfo Piperno
    Filter Models for a Parallel and Non Deterministic Lambda-Calculus. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:403-412 [Conf]
  33. Pietro Di Gianantonio
    Real Number Computability and Domain Theory. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:413-422 [Conf]
  34. Zinovy Diskin, Ilya Beylin
    Lambda Substitution Algebras. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:423-432 [Conf]
  35. Bruno Durand
    Global Properties of 2D Cellular Automata: Some Complexity Results. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:433-441 [Conf]
  36. Uffe Engberg, Glynn Winskel
    Completeness Results for Linear Logic on Petri Nets. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:442-452 [Conf]
  37. Alessandro Fantechi, Stefania Gnesi, V. Perticaroli
    An Expressive Logic for Basic Process Algebra. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:453-462 [Conf]
  38. Gudmund Skovbjerg Frandsen, Peter Bro Miltersen, Sven Skyum
    The Complexity of Finding Replicas Using Equality Tests. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:463-472 [Conf]
  39. Rob J. van Glabbeek
    A Complete Axiomatization for Branching Bisimulation Congruence of Finite-State Behaviours. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:473-484 [Conf]
  40. Erik de Haas, Peter van Emde Boas
    Object Oriented Application Flow Graphs and their Semantics. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:485-494 [Conf]
  41. Juraj Hromkovic, Jarkko Kari, Lila Kari
    Some Hierarchies for the Communication Complexity Measures of Cooperating Grammar Systems. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:495-505 [Conf]
  42. Louis Ibarra, Dana S. Richards
    Efficient Parallel Graph Algorithms Based on Open Ear Decomposition. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:506-516 [Conf]
  43. Oscar H. Ibarra, Nicholas Q. Trân
    On the Communication Complexity of Parallel Computation. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:517-526 [Conf]
  44. Petr Jancar, Frantisek Mráz, Martin Plátek
    A Taxonomy of Forgetting Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:527-536 [Conf]
  45. Jifeng He
    Hybrid Parallel Programming and Implementation of Synchronised Communication. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:537-546 [Conf]
  46. Astrid Kiehn
    Proof Systems for Cause Based Equivalences. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:547-556 [Conf]
  47. Bruno Martin
    A Uniform Universal CREW PRAM. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:557-565 [Conf]
  48. David Murphy
    Observing Located Concurrency. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:566-576 [Conf]
  49. Philippe Narbel
    The Boundary of Substitution Systems. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:577-587 [Conf]
  50. Jean Neraud
    New Algorithms for Detecting Morphic Images of a Word. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:588-597 [Conf]
  51. Pawel Paczkowski
    Ignoring Nonessential Interleavings in Assertional Reasoning on Concurrent Programs. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:598-607 [Conf]
  52. Michel Parigot, Paul Rozière
    Constant Time Reductions in Lambda-Caculus. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:608-617 [Conf]
  53. Francesco Parisi-Presicce, S. Veglioni
    Heterogeneous Unified Algebras. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:618-628 [Conf]
  54. Don Pigozzi, Antonino Salibra
    A Representation Theorem for Lambda Abstraction Algebras. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:629-639 [Conf]
  55. Regimantas Pliuskevicius
    On Saturated Calculi for a Linear Temporal Logic. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:640-649 [Conf]
  56. Hermann Puhlmann
    The Snack Powerdomain for Database Semantics. [Citation Graph (1, 0)][DBLP]
    MFCS, 1993, pp:650-659 [Conf]
  57. Bernhard Reus, Thomas Streicher
    Verifying Properties of Module Construction in Type Theory. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:660-670 [Conf]
  58. Peter Ruzicka, Juraj Waczulík
    On Time-Space Trade-Offs in Dynamic Graph Pebbling. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:671-681 [Conf]
  59. Vladimiro Sassone, Mogens Nielsen, Glynn Winskel
    Deterministic Behavioural Models for Concurrency. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:682-692 [Conf]
  60. David Scholefield, Hussein S. M. Zedan, Jifeng He
    Real-Time Refinement: Semantics and Application. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:693-702 [Conf]
  61. Bernhard Steffen, Carsten Weise
    Deciding Testing Equivalence for Real-Time Processes with Dense Time. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:703-713 [Conf]
  62. Werner Stephan, Andreas Wolpers
    A Calculus for Higher Order Procedures with Global Variables. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:714-723 [Conf]
  63. David Stevens
    Variable Substitution with Iconic Combinators. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:724-733 [Conf]
  64. Ralf Treinen
    Feature Constraints with First-Class Features. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:734-743 [Conf]
  65. Dorothea Wagner, Frank Wagner
    Between Min Cut and Graph Bisection. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:744-750 [Conf]
  66. Egon Wanke
    Paths and Cycles in Finite Periodic Graphs. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:751-760 [Conf]
  67. Jilei Yin, Zhu Hong
    Learning Decision Lists from Noisy Examples. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:761-766 [Conf]
  68. Nicolas Zabel
    Analytic Tableaux for Finite and Infinite Post Logics. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:767-776 [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