The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Paul Balister: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Robert Kozma, Marko Puljic, Paul Balister, Béla Bollobás, Walter J. Freeman
    Neuropercolation: A Random Cellular Automata Approach to Spatio-temporal Neurodynamics. [Citation Graph (0, 0)][DBLP]
    ACRI, 2004, pp:435-443 [Conf]
  2. Robert Kozma, Marko Puljic, Paul Balister, Béla Bollobás, Walter J. Freeman
    Phase transitions in the neuropercolation model of neural populations with mixed local and non-local interactions. [Citation Graph (0, 0)][DBLP]
    Biological Cybernetics, 2005, v:92, n:6, pp:367-379 [Journal]
  3. Paul Balister
    On The Alspach Conjecture. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2001, v:10, n:2, pp:- [Journal]
  4. Paul Balister
    Packing Circuits Into KN. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2001, v:10, n:6, pp:- [Journal]
  5. Paul Balister
    Packing Digraphs With Directed Closed Trails. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2003, v:12, n:1, pp:- [Journal]
  6. Paul Balister, Béla Bollobás, J. Cutler, Luke Pebody
    The Interlace Polynomial of Graphs at - 1. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2002, v:23, n:7, pp:761-767 [Journal]
  7. Paul Balister, Yair Caro, Cecil C. Rousseau, Raphael Yuster
    Zero-sum Square Matrices. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2002, v:23, n:5, pp:489-497 [Journal]
  8. Paul Balister, Béla Bollobás, Oliver Riordan, Richard H. Schelp
    Graphs with large maximum degree containing no odd cycles of a given length. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:87, n:2, pp:366-373 [Journal]
  9. Paul Balister
    Vertex-distinguishing edge colorings of random graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2002, v:20, n:1, pp:89-97 [Journal]
  10. Paul Balister, Béla Bollobás, Alan Stacey
    Improved Upper Bounds for the Critical Probability of Oriented Percolation in Two Dimensions. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1994, v:5, n:4, pp:573-590 [Journal]
  11. Paul Balister, Béla Bollobás, Alan Stacey
    Counting Boundary Paths for Oriented Percolation Clusters. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1999, v:14, n:1, pp:1-28 [Journal]

  12. Trap Coverage: Allowing Coverage Holes of Bounded Diameter in Wireless Sensor Networks. [Citation Graph (, )][DBLP]


  13. Random vs. Deterministic Deployment of Sensors in the Presence of Failures and Placement Errors. [Citation Graph (, )][DBLP]


  14. Reliable density estimates for coverage and connectivity in thin strips of finite length. [Citation Graph (, )][DBLP]


  15. The Linus Sequence. [Citation Graph (, )][DBLP]


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