( en | de | ru )

 

Disambiguation of "Bloniarz, Peter A."

Author of the publication

copydeleteadd this publication to your clipboard
An O(n log n) Lower Bound for Decomposing a Set of Points into Chains.

, and . Inf. Process. Lett., 31 (6): 319-322 (1989)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Peter A Ehrl

Peter A Schmid

Peter A Wuffli

Peter A Ehrl

Peter A Gloor

 

Other publications of authors with the same name

A Shortest-Path Algorithm with Expected Time O(n^2 log n log ^* n). STOC, page 378-384. ACM, (1980)An O(n log n) Lower Bound for Decomposing a Set of Points into Chains., and . Inf. Process. Lett., 31 (6): 319-322 (1989)A Shortest-Path Algorithm with Expected Time O(n2 log n log* n).. SIAM J. Comput., 12 (3): 588-600 (1983)Algebraic Structures with Hard Equivalence and Minimization Problems., , and . J. ACM, 31 (4): 879-904 (1984)From Keywords to Links: an Automatic Approach., and . ITCC (1), page 283-286. IEEE Computer Society, (2004)A Note on the Average Time to Compute Transitive Closures., , and . ICALP, page 425-434. Edinburgh University Press, (1976)Some assembly required: building a digital government for the 21st century., , , and . DG.O, volume 128 of ACM International Conference Proceeding Series, Digital Government Research Center, (2000)Some Assembly Required: Building a Digital Government for the 21st Century., , , and . DG.O, Digital Government Research Center, (2002)A Cost and Performance Model for Web Service Investment., and . Commun. ACM, 43 (2): 109-116 (2000)Information flows and smart disclosure of financial data: A framework for identifying challenges of cross boundary information sharing., , and . Gov. Inf. Q., 31 (Supplement-1): S72-S83 (2014)