Peter A. Bloniarz

Publication Activity (10 Years)

Years Active: 1976-2014
Publications (10 Years): 0

Top Topics

Fractional Brownian Motion

Information Sharing

Top Venues

Publications

Djoko Sigit Sayogo, Theresa A. Pardo, Peter A. Bloniarz
Information flows and smart disclosure of financial data: A framework for identifying challenges of cross boundary information sharing. Gov. Inf. Q. 31 (Supplement-1) (2014)
Djoko Sigit Sayogo, Theresa A. Pardo, Peter A. Bloniarz
Information sharing and financial market regulation: understanding the capability gap. ICEGOV (2012)
Robert Yoder, Peter A. Bloniarz
A Practical Algorithm for Computing Neighbors in Quadtrees, Octrees, and Hyperoctrees. MSV (2006)
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 J. Educ. Resour. Comput. 6 (3) (2006)
Jihong Zeng, Peter A. Bloniarz
From Keywords to Links: an Automatic Approach. ITCC (1) (2004)
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)
Kai R. T. Larsen, Peter A. Bloniarz
A Cost and Performance Model for Web Service Investment. Commun. ACM 43 (2) (2000)
Sharon S. Dawes, Peter A. Bloniarz, Kristine L. Kelly, Patricia D. Fletcher
century. DG.O (2000)
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)
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) (1989)
Harry B. Hunt III, Daniel J. Rosenkrantz, Peter A. Bloniarz
On the Computational Complexity of Algebra on Lattices. SIAM J. Comput. 16 (1) (1987)
Peter A. Bloniarz, Harry B. Hunt III, Daniel J. Rosenkrantz
Algebraic Structures with Hard Equivalence and Minimization Problems. J. ACM 31 (4) (1984)
Peter A. Bloniarz
log n log* n). SIAM J. Comput. 12 (3) (1983)
Peter A. Bloniarz
A Shortest-Path Algorithm with Expected Time O(n^2 log n log ^* n) STOC (1980)
Peter A. Bloniarz, Michael J. Fischer, Albert R. Meyer
A Note on the Average Time to Compute Transitive Closures. ICALP (1976)