Paul N. Balister

Paul Balister

	2011
44		Paul Balister, Béla Bollobás, Animashree Anandkumar, Alan S. Willsky: Energy-latency tradeoff for in-network function computation in random networks. INFOCOM 2011: 1575-1583
43		Paul N. Balister, Béla Bollobás, Animashree Anandkumar, Alan S. Willsky: Energy-Latency Tradeoff for In-Network Function Computation in Random Networks CoRR abs/1101.0858: (2011)
42		Phoebus Chen, Karl Henrik Johansson, Paul Balister, Béla Bollobás, Shankar Sastry: Multi-path Routing Metrics for Reliable Wireless Mesh Routing Topologies CoRR abs/1103.5957: (2011)
41		Paul N. Balister, Ervin Györi, Richard H. Schelp: Coloring vertices and edges of a graph by nonempty subsets of a set. Eur. J. Comb. 32(4): 533-537 (2011)
40		Paul Balister, Balázs Patkós: Random Partial Orders Defined by Angular Domains. Order 28(2): 341-355 (2011)
	2010
39		Paul Balister, Steve Kalikow, Amites Sarkar: The Linus Sequence. Combinatorics, Probability & Computing 19(1): 21-46 (2010)
38		Paul N. Balister, Béla Bollobás: Bond percolation with attenuation in high dimensional Voronoi tilings. Random Struct. Algorithms 36(1): 5-10 (2010)
37		Paul Balister, Béla Bollobás, J. Robert Johnson, Mark Walters: Random majority percolation. Random Struct. Algorithms 36(3): 315-340 (2010)
	2009
36		Paul Balister, Zizhan Zheng, Santosh Kumar, Prasun Sinha: Trap Coverage: Allowing Coverage Holes of Bounded Diameter in Wireless Sensor Networks. INFOCOM 2009: 136-144
35		Paul Balister, Santosh Kumar: Random vs. Deterministic Deployment of Sensors in the Presence of Failures and Placement Errors. INFOCOM 2009: 2896-2900
34		Paul N. Balister, Béla Bollobás, Amites Sarkar, Mark Walters: Highly connected random geometric graphs. Discrete Applied Mathematics 157(2): 309-320 (2009)
33		Paul N. Balister, Stefanie Gerke, Gregory Gutin, Adrian Johnstone, Joseph Reddington, Elizabeth Scott, Arezou Soleimanfallah, Anders Yeo: Algorithms for generating convex sets in acyclic digraphs. J. Discrete Algorithms 7(4): 509-518 (2009)
32		Paul Balister, Stefanie Gerke, Gregory Gutin: Convex Sets in Acyclic Digraphs. Order 26(1): 95-100 (2009)
	2008
31		Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp: Connected graphs without long paths. Discrete Mathematics 308(19): 4487-4494 (2008)
30		Paul N. Balister, Béla Bollobás, Amites Sarkar, Mark Walters: Connectivity of a Gaussian network. IJAHUC 3(3): 204-213 (2008)
29		Paul Balister, Béla Bollobás, Stefanie Gerke: Connectivity of addable graph classes. J. Comb. Theory, Ser. B 98(3): 577-584 (2008)
28		Paul Balister, Béla Bollobás, Stefanie Gerke: Sequences with Changing Dependencies. SIAM J. Discrete Math. 22(3): 1149-1154 (2008)
	2007
27		Paul Balister, Béla Bollobás, Amites Sarkar, Santosh Kumar: Reliable density estimates for coverage and connectivity in thin strips of finite length. MOBICOM 2007: 75-86
26		Paul N. Balister, Stefanie Gerke, Gregory Gutin, Adrian Johnstone, Joseph Reddington, Elizabeth Scott, Arezou Soleimanfallah, Anders Yeo: Algorithms for Generating Convex Sets in Acyclic Digraphs CoRR abs/0712.2661: (2007)
25		Paul N. Balister, Stefanie Gerke, Gregory Gutin: Convex sets in acyclic digraphs CoRR abs/0712.2678: (2007)
24		Paul N. Balister, Béla Bollobás, Stefanie Gerke: The generalized Randic index of trees. Journal of Graph Theory 56(4): 270-286 (2007)
23		Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp: Adjacent Vertex Distinguishing Edge-Colorings. SIAM J. Discrete Math. 21(1): 237-250 (2007)
	2006
22		Paul N. Balister, Béla Bollobás: Pair dominating graphs. Eur. J. Comb. 27(2): 322-328 (2006)
21		Paul N. Balister, András Gyárfás, Jenö Lehel, Richard H. Schelp: Mono-multi bipartite Ramsey numbers, designs, and matrices. J. Comb. Theory, Ser. A 113(1): 101-112 (2006)
20		Paul N. Balister, Jenö Lehel, Richard H. Schelp: Ramsey unsaturated and saturated graphs. Journal of Graph Theory 51(1): 22-32 (2006)
19		Paul N. Balister, Béla Bollobás, Robert Kozma: Large deviations for mean field models of probabilistic cellular automata. Random Struct. Algorithms 29(3): 399-415 (2006)
	2005
18		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. Biological Cybernetics 92(6): 367-379 (2005)
17		Paul N. Balister, Béla Bollobás, Anthony Quas: Percolation in Voronoi tilings. Random Struct. Algorithms 26(3): 310-318 (2005)
16		Paul N. Balister, Béla Bollobás, Mark Walters: Continuum percolation with steps in the square or the disc. Random Struct. Algorithms 26(4): 392-403 (2005)
	2004
15		Robert Kozma, Marko Puljic, Paul Balister, Béla Bollobás, Walter J. Freeman: Neuropercolation: A Random Cellular Automata Approach to Spatio-temporal Neurodynamics. ACRI 2004: 435-443
14		Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp: Longest Paths in Circular Arc Graphs. Combinatorics, Probability & Computing 13(3): 311-317 (2004)
13		Paul N. Balister, Alexandr V. Kostochka, Hao Li, Richard H. Schelp: Balanced edge colorings. J. Comb. Theory, Ser. B 90(1): 3-20 (2004)
	2003
12		Paul Balister: Packing Digraphs With Directed Closed Trails. Combinatorics, Probability & Computing 12(1): 1-15 (2003)
11		Paul Balister, Béla Bollobás, Oliver Riordan, Richard H. Schelp: Graphs with large maximum degree containing no odd cycles of a given length. J. Comb. Theory, Ser. B 87(2): 366-373 (2003)
10		Paul N. Balister: Packing closed trails into dense graphs. J. Comb. Theory, Ser. B 88(1): 107-118 (2003)
	2002
9		Paul N. Balister, Béla Bollobás, Richard H. Schelp: Vertex distinguishing colorings of graphs with Delta(G)=2. Discrete Mathematics 252(1-3): 17-29 (2002)
8		Paul Balister, Yair Caro, Cecil C. Rousseau, Raphael Yuster: Zero-sum Square Matrices. Eur. J. Comb. 23(5): 489-497 (2002)
7		Paul Balister, Béla Bollobás, J. Cutler, Luke Pebody: The Interlace Polynomial of Graphs at - 1. Eur. J. Comb. 23(7): 761-767 (2002)
6		Paul Balister: Vertex-distinguishing edge colorings of random graphs. Random Struct. Algorithms 20(1): 89-97 (2002)
	2001
5		Paul Balister: On The Alspach Conjecture. Combinatorics, Probability & Computing 10(2): 95-125 (2001)
4		Paul Balister: Packing Circuits Into KN. Combinatorics, Probability & Computing 10(6): 0- (2001)
3		Paul N. Balister, Béla Bollobás, Oliver Riordan, Alex D. Scott: Alternating Knot Diagrams, Euler Circuits and the Interlace Polynomial. Eur. J. Comb. 22(1): 1-4 (2001)
	1999
2		Paul Balister, Béla Bollobás, Alan Stacey: Counting Boundary Paths for Oriented Percolation Clusters. Random Struct. Algorithms 14(1): 1-28 (1999)
	1994
1		Paul Balister, Béla Bollobás, Alan Stacey: Improved Upper Bounds for the Critical Probability of Oriented Percolation in Two Dimensions. Random Struct. Algorithms 5(4): 573-590 (1994)

Coauthor Index

1	Animashree Anandkumar	[43] [44]
2	Béla Bollobás	[1] [2] [3] [7] [9] [11] [15] [16] [17] [18] [19] [22] [24] [27] [28] [29] [30] [34] [37] [38] [42] [43] [44]
3	Yair Caro	[8]
4	Phoebus Chen	[42]
5	J. Cutler	[7]
6	Walter J. Freeman	[15] [18]
7	Stefanie Gerke	[24] [25] [26] [28] [29] [32] [33]
8	Gregory Gutin	[25] [26] [32] [33]
9	András Gyárfás	[21]
10	Ervin Györi	[14] [23] [31] [41]
11	Karl Henrik Johansson	[42]
12	J. Robert Johnson	[37]
13	Adrian Johnstone	[26] [33]
14	Steve Kalikow	[39]
15	Alexandr V. Kostochka	[13]
16	Robert Kozma (Robert B. Kozma)	[15] [18] [19]
17	Santosh Kumar	[27] [35] [36]
18	Jenö Lehel (Jeno Lehel)	[14] [20] [21] [23] [31]
19	Hao Li	[13]
20	Balázs Patkós	[40]
21	Luke Pebody	[7]
22	Marko Puljic	[15] [18]
23	Anthony Quas	[17]
24	Joseph Reddington	[26] [33]
25	Oliver Riordan	[3] [11]
26	Cecil C. Rousseau	[8]
27	Amites Sarkar	[27] [30] [34] [39]
28	Shankar Sastry (Shankar S. Sastry)	[42]
29	Richard H. Schelp	[9] [11] [13] [14] [20] [21] [23] [31] [41]
30	Alex D. Scott (Alexander D. Scott)	[3]
31	Elizabeth Scott	[26] [33]
32	Prasun Sinha	[36]
33	Arezou Soleimanfallah	[26] [33]
34	Alan Stacey	[1] [2]
35	Mark Walters	[16] [30] [34] [37]
36	Alan S. Willsky	[43] [44]
37	Anders Yeo	[26] [33]
38	Raphael Yuster	[8]
39	Zizhan Zheng	[36]

Colors in the list of coauthors

Last update Sun May 27 04:04:01 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page