2006 |
12 | | Robert Yoder,
Peter A. Bloniarz:
A Practical Algorithm for Computing Neighbors in Quadtrees, Octrees, and Hyperoctrees.
MSV 2006: 249-255 |
11 | EE | 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 |
10 | EE | Jihong Zeng,
Peter A. Bloniarz:
From Keywords to Links: an Automatic Approach.
ITCC (1) 2004: 283-286 |
2002 |
9 | EE | 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 |
8 | EE | 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 |
7 | EE | Kai R. T. Larsen,
Peter A. Bloniarz:
A Cost and Performance Model for Web Service Investment.
Commun. ACM 43(2): 109-116 (2000) |
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 | EE | 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(n² 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 |