The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Henning Wunderlich: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Martin Dietzfelbinger, Henning Wunderlich
    A characterization of average case communication complexity. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:101, n:6, pp:245-249 [Journal]
  2. Karl-Heinz Niggl, Henning Wunderlich
    Certifying Polynomial Time and Linear/Polynomial Space for Imperative Programs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:35, n:5, pp:1122-1147 [Journal]

  3. On Toda's Theorem in Structural Communication Complexity. [Citation Graph (, )][DBLP]


  4. On cover-structure graphs. [Citation Graph (, )][DBLP]


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