The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Walter Baur: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Walter Baur
    Zeitlich beschränkte Turingmaschinen und polynomiale Reduktion. [Citation Graph (0, 0)][DBLP]
    Komplexität von Entscheidungsproblemen 1976, 1976, pp:11-19 [Conf]
  2. Walter Baur, Karin Halupczok
    On lower bounds for the complexity of polynomials and their multiples. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1999, v:8, n:4, pp:309-315 [Journal]
  3. Walter Baur
    Simplified Lower Bounds for Polynomials with Algebraic Coefficients. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1997, v:13, n:1, pp:38-41 [Journal]
  4. Walter Baur
    N0-Categorical Modules. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1975, v:40, n:2, pp:213-220 [Journal]
  5. Walter Baur
    On the Elementary Theory of Pairs of Real Closed Fields. II. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1982, v:47, n:3, pp:669-679 [Journal]
  6. Walter Baur, Volker Strassen
    The Complexity of Partial Derivatives. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1983, v:22, n:, pp:317-330 [Journal]

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