Peter A. Bloniarz - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 15 from 15

2014

Information flows and smart disclosure of financial data: A framework for identifying challenges of cross boundary information sharingDjoko Sigit Sayogo, Theresa A. Pardo, Peter A. Bloniarz. giq, 31(Supplement-1), 2014. [doi]

2012

Information sharing and financial market regulation: understanding the capability gapDjoko Sigit Sayogo, Theresa A. Pardo, Peter A. Bloniarz. icegov 2012: 123-131 [doi]

2006

Innovative model for information assurance curriculum: A teaching hospitalSanjay 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. jeric, 6(3):2, 2006. [doi]

A Practical Algorithm for Computing Neighbors in Quadtrees, Octrees, and HyperoctreesRobert Yoder, Peter A. Bloniarz. vveis 2006: 249-255

2004

From Keywords to Links: an Automatic ApproachJihong Zeng, Peter A. Bloniarz. itcc 2004: 283-286 [doi]

2002

Some Assembly Required: Building a Digital Government for the 21st CenturySharon S. Dawes, Peter A. Bloniarz, Kristine L. Kelly, Patricia D. Fletcher. DG.O 2002: [doi]

2000

Some assembly required: building a digital government for the 21:::st::: centurySharon S. Dawes, Peter A. Bloniarz, Kristine L. Kelly, Patricia D. Fletcher. DG.O 2000: [doi]

A Cost and Performance Model for Web Service InvestmentKai R. T. Larsen, Peter A. Bloniarz. CACM, 43(2):109-116, 2000. [doi]

1998

A cost and performance analysis of developing and maintaining Web services: preliminary results from an empirical analysis of state agenciesKai R. T. Larsen, Peter A. Bloniarz. ecis 1998: 528-541 [doi]

1989

An O(n log n) Lower Bound for Decomposing a Set of Points into ChainsPeter A. Bloniarz, S. S. Ravi. ipl, 31(6):319-322, 1989.

1987

On the Computational Complexity of Algebra on LatticesHarry B. Hunt III, Daniel J. Rosenkrantz, Peter A. Bloniarz. SICOMP, 16(1):129-148, 1987.

1984

Algebraic Structures with Hard Equivalence and Minimization ProblemsPeter A. Bloniarz, Harry B. Hunt III, Daniel J. Rosenkrantz. JACM, 31(4):879-904, 1984. [doi]

1983

A Shortest-Path Algorithm with Expected Time O(n² log n log* n)Peter A. Bloniarz. SICOMP, 12(3):588-600, 1983.

1980

A Shortest-Path Algorithm with Expected Time O(n^2 log n log ^* n)Peter A. Bloniarz. stoc 1980: 378-384

1976

A Note on the Average Time to Compute Transitive ClosuresPeter A. Bloniarz, Michael J. Fischer, Albert R. Meyer. icalp 1976: 425-434

Sign in or sign up to see more results.

runs on WebDSL