The SCEAS System
Navigation Menu

Search the dblp DataBase


Lothar Schmitz: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Lothar Schmitz
    An improved transitive closure algorithm. [Citation Graph (3, 0)][DBLP]
    Computing, 1983, v:30, n:, pp:359-371 [Journal]
  2. Bernd-Jürgen Falkowski, Lothar Schmitz
    A Note on the Queens' Problem. [Citation Graph (1, 0)][DBLP]
    Inf. Process. Lett., 1986, v:23, n:1, pp:39-46 [Journal]
  3. Lothar Schmitz
    An Exercise in Program Synthesis: Algorithms for Computing the Transitive Closure of a Relation. [Citation Graph (1, 0)][DBLP]
    Sci. Comput. Program., 1982, v:1, n:3, pp:235-254 [Journal]
  4. Birgit Demuth, Heinrich Hußmann, Steffen Zschaler, Lothar Schmitz
    A Framework-Based Approach to Teaching OOT: Aims, Implementation, and Experience. [Citation Graph (0, 0)][DBLP]
    CSEE&T, 2000, pp:283-293 [Conf]
  5. Peter Rödig, Uwe M. Borghoff, Jan Scheffczyk, Lothar Schmitz
    Preservation of digital publications: an OAIS extension and implementation. [Citation Graph (0, 0)][DBLP]
    ACM Symposium on Document Engineering, 2003, pp:131-139 [Conf]
  6. Jan Scheffczyk, Peter Rödig, Uwe M. Borghoff, Lothar Schmitz
    Managing inconsistent repositories via prioritized repairs. [Citation Graph (0, 0)][DBLP]
    ACM Symposium on Document Engineering, 2004, pp:137-146 [Conf]
  7. Jan Scheffczyk, Uwe M. Borghoff, Peter Rödig, Lothar Schmitz
    Consistent document engineering: formalizing type-safe consistency rules for heterogeneous repositories. [Citation Graph (0, 0)][DBLP]
    ACM Symposium on Document Engineering, 2003, pp:140-149 [Conf]
  8. Lothar Schmitz
    Zum Nutzen sequentieller Kontrollabstraktionen. [Citation Graph (0, 0)][DBLP]
    GI Jahrestagung, 1997, pp:522-531 [Conf]
  9. Stephan Heilbrunner, Lothar Schmitz
    For Statements with Restricted Enumerations. [Citation Graph (0, 0)][DBLP]
    Symposium on Programming, 1984, pp:145-154 [Conf]
  10. Lothar Schmitz
    Reengineering als Lehrgegenstand: Zweck und gestaltung. [Citation Graph (0, 0)][DBLP]
    SEUH, 1994, pp:90-93 [Conf]
  11. Lothar Schmitz
    Agenda für die Arbeitsgruppe Curriculum. [Citation Graph (0, 0)][DBLP]
    SEUH, 1994, pp:129-132 [Conf]
  12. Jan Scheffczyk, Uwe M. Borghoff, Peter Rödig, Lothar Schmitz
    Efficient (In-)Consistency Management for Heterogeneous Repositories. [Citation Graph (0, 0)][DBLP]
    SNPD, 2003, pp:370-377 [Conf]
  13. Jörg Kröger, Lothar Schmitz
    IPG - An Interactive Parser Generator. [Citation Graph (0, 0)][DBLP]
    STACS, 1991, pp:543-544 [Conf]
  14. Jürgen M. Janas, Lothar Schmitz, Hans-Rüdiger Wiehle
    Systemdarstellung mit Hilfe eines programmbeschrifteten Netzmodells in der DIN66265. [Citation Graph (0, 0)][DBLP]
    Inform., Forsch. Entwickl., 1986, v:1, n:4, pp:181-198 [Journal]
  15. Lothar Schmitz
    Wiederverwendbarkeit von Software - eine Fallstudie anhand von Ada und Smalltalk. [Citation Graph (0, 0)][DBLP]
    Informatik Spektrum, 1990, v:13, n:2, pp:71-85 [Journal]
  16. Lothar Schmitz, Uwe M. Borghoff, Peter Rödig, Jan Scheffczyk
    Langzeitarchivierung. [Citation Graph (0, 0)][DBLP]
    Informatik Spektrum, 2005, v:28, n:6, pp:489-492 [Journal]
  17. Lothar Schmitz
    The visual compiler-compiler SIC (abstract). [Citation Graph (0, 0)][DBLP]
    OOPS Messenger, 1993, v:4, n:2, pp:236- [Journal]
  18. Lothar Schmitz
    Using Inheritance to Explore a Family of Algorithms. [Citation Graph (0, 0)][DBLP]
    Structured Programming, 1992, v:13, n:2, pp:55-64 [Journal]
  19. Stephan Heilbrunner, Lothar Schmitz
    An Efficient Recognizer for the Boolean Closure of Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:80, n:1, pp:53-75 [Journal]

Search in 0.003secs, Finished in 0.003secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
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 [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002