- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| c8 |      | Djoko Sigit Sayogo, Theresa A. Pardo, Peter A. Bloniarz: Information sharing and financial market regulation: understanding the capability gap. ICEGOV 2012: 123-131 |
| 2006 | ||
| j6 | | 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) |
| c7 |  | Robert Yoder, Peter A. Bloniarz: A Practical Algorithm for Computing Neighbors in Quadtrees, Octrees, and Hyperoctrees. MSV 2006: 249-255 |
| 2004 | ||
| c6 | | Jihong Zeng, Peter A. Bloniarz: From Keywords to Links: an Automatic Approach. ITCC (1) 2004: 283-286 |
| 2002 | ||
| c5 | | 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 | ||
| j5 | | Kai R. T. Larsen, Peter A. Bloniarz: A Cost and Performance Model for Web Service Investment. Commun. ACM 43(2): 109-116 (2000) |
| c4 | | 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 |
| 1998 | ||
| c3 | | 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 | ||
| j4 | | 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 | ||
| j3 | | 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 | ||
| j2 | | 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 | ||
| j1 | | 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 | ||
| c2 | | Peter A. Bloniarz: A Shortest-Path Algorithm with Expected Time O(n^2 log n log ^* n). STOC 1980: 378-384 |
| 1976 | ||
| c1 | | Peter A. Bloniarz, Michael J. Fischer, Albert R. Meyer: A Note on the Average Time to Compute Transitive Closures. ICALP 1976: 425-434 |
Colors in the list of coauthors
Last update Mon May 20 22:28:38 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page