Peter A. Bloniarz

According to our database, Peter A. Bloniarz authored at least 15 papers between 1976 and 2014.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2014

Information flows and smart disclosure of financial data: A framework for identifying challenges of cross boundary information sharing.

Djoko Sigit Sayogo, Theresa A. Pardo, Peter A. Bloniarz

Gov. Inf. Q., 2014

2012

Information sharing and financial market regulation: understanding the capability gap.

Djoko Sigit Sayogo, Theresa A. Pardo, Peter A. Bloniarz

Proceedings of the 6th International Conference on Theory and Practice of Electronic Governance, 2012

2006

Innovative model for information assurance curriculum: A teaching hospital.

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

ACM J. Educ. Resour. Comput., 2006

A Practical Algorithm for Computing Neighbors in Quadtrees, Octrees, and Hyperoctrees.

Robert Yoder, Peter A. Bloniarz

Proceedings of the 2006 International Conference on Modeling, 2006

2004

From Keywords to Links: an Automatic Approach.

Jihong Zeng, Peter A. Bloniarz

Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'04), 2004

2002

Some Assembly Required: Building a Digital Government for the 21st Century.

Sharon S. Dawes, Peter A. Bloniarz, Kristine L. Kelly, Patricia D. Fletcher

Proceedings of the 2002 Annual National Conference on Digital Government Research, 2002

2000

A Cost and Performance Model for Web Service Investment.

Kai R. T. Larsen, Peter A. Bloniarz

Commun. ACM, 2000

Some assembly required: building a digital government for the 21^st century.

Sharon S. Dawes, Peter A. Bloniarz, Kristine L. Kelly, Patricia D. Fletcher

Proceedings of the 2000 National Conference on Digital Government Research, 2000

1998

A cost and performance analysis of developing and maintaining Web services: preliminary results from an empirical analysis of state agencies.

Kai R. T. Larsen, Peter A. Bloniarz

Proceedings of the Sixth European Conference on Information Systems, 1998

1989

An O(n log n) Lower Bound for Decomposing a Set of Points into Chains.

Peter A. Bloniarz, S. S. Ravi

Inf. Process. Lett., 1989

1987

On the Computational Complexity of Algebra on Lattices.

Harry B. Hunt III, Daniel J. Rosenkrantz, Peter A. Bloniarz

SIAM J. Comput., 1987

1984

Algebraic Structures with Hard Equivalence and Minimization Problems.

Peter A. Bloniarz, Harry B. Hunt III, Daniel J. Rosenkrantz

J. ACM, 1984

1983

A Shortest-Path Algorithm with Expected Time O(n² log n log* n).

Peter A. Bloniarz

SIAM J. Comput., 1983

1980

A Shortest-Path Algorithm with Expected Time O(n^2 log n log ^* n)

Peter A. Bloniarz

Proceedings of the 12th Annual ACM Symposium on Theory of Computing, 1980

1976

A Note on the Average Time to Compute Transitive Closures.

Peter A. Bloniarz, Michael J. Fischer, Albert R. Meyer

Proceedings of the Third International Colloquium on Automata, 1976