Peter A. Bloniarz

Available identifiers

Publication	Date of Publication	Type
An $\Omega$ (n log n) lower bound for decomposing a set of points into chains	1989-01-01	Paper
On the Computational Complexity of Algebra on Lattices	1987-01-01	Paper
Algebraic Structures with Hard Equivalence and Minimization Problems	1984-01-01	Paper
A Shortest-Path Algorithm with Expected Time $O(n^2 \log n\log ^ * n)$	1983-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4138127	1976-01-01	Paper

This page was built for person: Peter A. Bloniarz

Publication	Date of Publication	Type
An \(\Omega\) (n log n) lower bound for decomposing a set of points into chains	1989-01-01	Paper
On the Computational Complexity of Algebra on Lattices	1987-01-01	Paper
Algebraic Structures with Hard Equivalence and Minimization Problems	1984-01-01	Paper
A Shortest-Path Algorithm with Expected Time $O(n^2 \log n\log ^ * n)$	1983-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4138127	1976-01-01	Paper