Peter A. Bloniarz

15 papers A* 2Journal 7Unranked 6
YearRankTypeTitle / Venue / Authors
2014 J jnl
Information flows and smart disclosure of financial data: A framework for identifying challenges of cross boundary information sharing.
Gov. Inf. Q.
Djoko Sigit Sayogo, Theresa A. Pardo, Peter A. Bloniarz
2012 — conf
Information sharing and financial market regulation: understanding the capability gap.
ICEGOV
Djoko Sigit Sayogo, Theresa A. Pardo, Peter A. Bloniarz
2006 — conf
A Practical Algorithm for Computing Neighbors in Quadtrees, Octrees, and Hyperoctrees.
MSV
Robert Yoder, Peter A. Bloniarz
2006 J jnl
Innovative model for information assurance curriculum: A teaching hospital.
ACM J. Educ. Resour. Comput.
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
2004 — conf
From Keywords to Links: an Automatic Approach.
ITCC (1)
Jihong Zeng, Peter A. Bloniarz
2002 — conf
Some Assembly Required: Building a Digital Government for the 21st Century.
DG.O
Sharon S. Dawes, Peter A. Bloniarz, Kristine L. Kelly, Patricia D. Fletcher
2000 J jnl
A Cost and Performance Model for Web Service Investment.
Commun. ACM
Kai R. T. Larsen, Peter A. Bloniarz
2000 — conf
Some assembly required: building a digital government for the 21
DG.O
Sharon S. Dawes, Peter A. Bloniarz, Kristine L. Kelly, Patricia D. Fletcher
1998 — conf
A cost and performance analysis of developing and maintaining Web services: preliminary results from an empirical analysis of state agencies.
ECIS
Kai R. T. Larsen, Peter A. Bloniarz
1989 J jnl
An O(n log n) Lower Bound for Decomposing a Set of Points into Chains.
Inf. Process. Lett.
Peter A. Bloniarz, S. S. Ravi
1987 J jnl
On the Computational Complexity of Algebra on Lattices.
SIAM J. Comput.
Harry B. Hunt III, Daniel J. Rosenkrantz, Peter A. Bloniarz
1984 J jnl
Algebraic Structures with Hard Equivalence and Minimization Problems.
J. ACM
Peter A. Bloniarz, Harry B. Hunt III, Daniel J. Rosenkrantz
1983 J jnl
A Shortest-Path Algorithm with Expected Time O(n
SIAM J. Comput.
Peter A. Bloniarz
1980 A* conf
A Shortest-Path Algorithm with Expected Time O(n^2 log n log ^* n)
STOC
Peter A. Bloniarz
1976 A* conf
A Note on the Average Time to Compute Transitive Closures.
ICALP
Peter A. Bloniarz, Michael J. Fischer, Albert R. Meyer