default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter A. Bloniarz
Person information
- affiliation: University at Albany, SUNY, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[j7]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): S72-S83 (2014)- 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
2000 – 2009
- 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 J. Educ. Resour. Comput. 6(3): 2 (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
1990 – 1999
- 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
1980 – 1989
- 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
1970 – 1979
- 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
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
