The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Peter Tittmann: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. André Poenitz, Peter Tittmann
    Improved Upper Bounds for Self-Avoiding Walks in Zd. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2000, v:7, n:, pp:- [Journal]
  2. Peter Tittmann
    Partitions and Network Reliability. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:95, n:1-3, pp:445-453 [Journal]
  3. Klaus Dohmen, André Poenitz, Peter Tittmann
    A new two-variable generalization of the chromatic polynomial. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2003, v:6, n:1, pp:69-90 [Journal]
  4. Peter Tittmann, Andrea Blechschmidt
    Reliability Bounds Based on Network Splitting. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1991, v:27, n:5/6, pp:317-326 [Journal]

  5. A Graph Polynomial Arising from Community Structure (Extended Abstract). [Citation Graph (, )][DBLP]


  6. Random Information Spread in Networks [Citation Graph (, )][DBLP]


  7. Bonferroni-type inequalities and binomially bounded functions. [Citation Graph (, )][DBLP]


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