Petr Kolman

Deprecated: The each() function is deprecated. This message will be suppressed on further calls in /home/zhenxiangba/zhenxiangba.com/public_html/phproxy-improved-master/index.php on line 456
Petr Kolman

Petr Kolman

Institute for Theoretical Computer Science, Charles University,
Malostranské nám. 25, 118 00 Praha 1, Czech Republic

E-mail: kolman "at" kam.mff.cuni.cz

Phone: + 420 - 22191 4233

Fax: + 420 - 2 - 5753 1014 (fax)

For what I received I passed on to you as of first importance: that Christ died for our sins according to the Scriptures, that he was buried, that he was raised on the third day according to the Scriptures, and that he appeared to Peter, and then to the Twelve. After that, he appeared to more than five hundred of the brothers at the same time, most of whom are still living, though some have fallen asleep. Then he appeared to James, then to all the apostles, and last of all he appeared to me also. Whether, then, it was I or they, this is what we preach, and this is what you believed.

Paul of Tarsus, The Epistle to the Romans

Publications

Approximating Reversal Distance for Strings with Bounded Number of Duplicates in Linear Time
2004
Minimum Common String Partition Problem: Hardness and Approximations
with Avraham Goldstein and Jie Zheng
In: Proc. of 15 International Symposium on Algorithms and Computation (ISAAC), pp. 473-4842004
The Greedy Algorithm for the Minimum Common String Partition Problem
with Marek Chrobak and Jirka Sgall
To appear in: ACM Transactions on Algorithms
Preliminary version in: Proc. of 7 International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), pp. 84-95, 2004.
A Simple Combinatorial Proof of Duality of Multiroute Flows and Cuts, 2004.
with Amitabha Bagchi, Amitabh Chaudhary and Jirka Sgall
Crossing number, pair-crossing number, and expansion
with Jirka Matousek
Journal of Combinatorial Theory, Series B, Volume 92, Issue 1, Sep. 2004, pp. 99-113.
Short Length Menger's Theorem and Reliable Optical Routing
with Amitabha Bagchi and Amitabh Chaudhary
In: Proc. 15 ACM Symposium on Parallel Algorithms and Architectures (SPAA), revue paper, 2003.
A Note on the Greedy Algorithm for the Unsplittable Flow Problem
Information Processing Letters, Volume 88, Issue 3, 2003, pp. 101-105.
Algorithms for Fault-Tolerant Routing in Circuit Switched Networks
with Amitabha Bagchi, Amitabh Chaudhary, and Christian Scheideler
In: Proc. 14 ACM Symposium on Parallel Algorithms and Architectures (SPAA), 2002.
Improved Bounds for the Unsplittable Flow Problem
with Christian Scheideler
To appear in: Journal of Algorithms
Preliminary version in: Proc. 13 ACM-SIAM Symposium on Discrete Algorithms (SODA), 2002.
Simple On-Line Algorithms for the Maximum Disjoint Paths Problem
with Christian Scheideler
Algorithmica, Volume 39, Number 3, 2004, pp. 209-233.
Preliminary version in: Proc. 13 ACM Symposium on Parallel Algorithms and Architectures (SPAA), 2001.
Optimal Broadcast on Parallel Locality Models
with Ben Juurlink, Friedhelm Meyer auf der Heide and Ingo Rieping.
Journal of Discrete Algorithms, Volume 1, Issue 2, 2003, pp. 151-166.
Preliminary version in: Proc. of 7 Colloquium on Structural Information and Communication Complexity (SIROCCO), 2000.
Short Disjoint Paths on Hypercubic Graphs
Technical report, 2000
On nonblocking properties of the Benes network
In: Proc. of 6 European Symposium on Algorithms (ESA), volume 1461 of Lecture Notes in Computer Science. Springer, 1998.
PRAM lower bound for element distinctness revisited
In Sofsem'97: Theory and Practice of Informatics, volume 1338 of Lecture Notes in Computer Science. Springer, 1997.
Searching for edge disjoint paths on hypercube-like topologies
PhD Thesis, Charles University, Prague, 1998.
Complexity of some problems on COMMON PRAM
Masters Thesis, Charles University, Prague, 1995, in Czech.

Teaching:

Ruzne obrazky

Starkov, leto 2001
Hostice, leto 2001
Hnacov, leto 2002
Pec, zima 2002
Vrsov, leto 2003

April 12, 2004