The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Michael Bertol: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Michael Bertol, Volker Diekert
    On Efficient Reduction Algorithms for Some Trace Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    Term Rewriting, 1993, pp:114-126 [Conf]
  2. Michael Bertol
    Efficient Rewriting in Cograph Trace Monoids. [Citation Graph (0, 0)][DBLP]
    FCT, 1995, pp:146-155 [Conf]
  3. Zoltán Ésik, Michael Bertol
    Nonfinite Axiomatizability of the Equational Theory of Shuffle. [Citation Graph (0, 0)][DBLP]
    ICALP, 1995, pp:27-38 [Conf]
  4. Michael Bertol, Volker Diekert
    Trace Rewriting: Computing Normal Forms in Time O(n log n). [Citation Graph (0, 0)][DBLP]
    STACS, 1996, pp:269-280 [Conf]
  5. Zoltán Ésik, Michael Bertol
    Nonfinite Axiomatizability of the Equational Theory of Shuffle. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1998, v:35, n:6, pp:505-539 [Journal]
  6. Michael Bertol, Klaus Reinhardt
    The Tautologies over a Finite Set are Context-Free. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1995, v:57, n:, pp:- [Journal]

Search in 0.001secs, Finished in 0.001secs
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