Peter A. Bloniarz

	2006
13		Robert Yoder, Peter A. Bloniarz: A Practical Algorithm for Computing Neighbors in Quadtrees, Octrees, and Hyperoctrees. MSV 2006: 249-255
12		Sanjay Goel, Damira Pon, Peter A. Bloniarz, Robert Bangert-Drowns, George Berg, Vince Delio, Laura Iwan, Thomas Hurbanek, Sandoor P. Schuman, Jagdish Gangolly, Adnan Baykal, Jon Hobbs: Innovative model for information assurance curriculum: A teaching hospital. ACM Journal of Educational Resources in Computing 6(3): (2006)
	2004
11		Jihong Zeng, Peter A. Bloniarz: From Keywords to Links: an Automatic Approach. ITCC (1) 2004: 283-286
	2002
10		Sharon S. Dawes, Peter A. Bloniarz, Kristine L. Kelly, Patricia D. Fletcher: Some Assembly Required: Building a Digital Government for the 21st Century. DG.O 2002
	2000
9		Sharon S. Dawes, Peter A. Bloniarz, Kristine L. Kelly, Patricia D. Fletcher: Some assembly required: building a digital government for the 21st century. DG.O 2000
8		Kai R. T. Larsen, Peter A. Bloniarz: A Cost and Performance Model for Web Service Investment. Commun. ACM 43(2): 109-116 (2000)
	1998
7		Kai R. T. Larsen, Peter A. Bloniarz: A cost and performance analysis of developing and maintaining Web services: preliminary results from an empirical analysis of state agencies. ECIS 1998: 528-541
	1989
6		Peter A. Bloniarz, S. S. Ravi: An O(n log n) Lower Bound for Decomposing a Set of Points into Chains. Inf. Process. Lett. 31(6): 319-322 (1989)
	1987
5		Harry B. Hunt III, Daniel J. Rosenkrantz, Peter A. Bloniarz: On the Computational Complexity of Algebra on Lattices. SIAM J. Comput. 16(1): 129-148 (1987)
	1984
4		Peter A. Bloniarz, Harry B. Hunt III, Daniel J. Rosenkrantz: Algebraic Structures with Hard Equivalence and Minimization Problems. J. ACM 31(4): 879-904 (1984)
	1983
3		Peter A. Bloniarz: A Shortest-Path Algorithm with Expected Time O(n2 log n log* n). SIAM J. Comput. 12(3): 588-600 (1983)
	1980
2		Peter A. Bloniarz: A Shortest-Path Algorithm with Expected Time O(n^2 log n log ^* n) STOC 1980: 378-384
	1976
1		Peter A. Bloniarz, Michael J. Fischer, Albert R. Meyer: A Note on the Average Time to Compute Transitive Closures. ICALP 1976: 425-434

Coauthor Index

1	Robert Bangert-Drowns	[12]
2	Adnan Baykal	[12]
3	George Berg	[12]
4	Sharon S. Dawes	[9] [10]
5	Vince Delio	[12]
6	Michael J. Fischer	[1]
7	Patricia D. Fletcher	[9] [10]
8	Jagdish Gangolly	[12]
9	Sanjay Goel	[12]
10	Jon Hobbs	[12]
11	Harry B. Hunt III	[4] [5]
12	Thomas Hurbanek	[12]
13	Laura Iwan	[12]
14	Kristine L. Kelly	[9] [10]
15	Kai R. T. Larsen	[7] [8]
16	Albert R. Meyer	[1]
17	Damira Pon	[12]
18	S. S. Ravi	[6]
19	Daniel J. Rosenkrantz	[4] [5]
20	Sandoor P. Schuman	[12]
21	Robert Yoder	[13]
22	Jihong Zeng	[11]

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