#### Filter Results:

- Full text PDF available (55)

#### Publication Year

1988

2017

- This year (6)
- Last 5 years (28)
- Last 10 years (46)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Boris V. Cherkassky, Andrew V. Goldberg, Tomasz Radzik
- Math. Program.
- 1994

We conduct an extensive computational study of shortest paths algorithms, including some very recent algorithms. We also suggest new algorithms motivated by the experimental results and prove interesting theoretical results suggested by the experimental data. Our computational study is based on several natural problem classes which identify strengths and… (More)

- Tomasz Radzik, Andrew V. Goldberg
- Algorithmica
- 1991

We prove a tight Θ(min(nm log(nC), nm2)) bound on the number of iterations of the minimum-mean cycle-canceling algorithm of Goldberg and Tarjan [13]. We do this by giving the lower bound and by improving the strongly polynomial upper bound on the number of iterations toO(nm 2). We also give an improved version of the maximum-mean cut canceling algorithm of… (More)

- Tomasz Radzik
- Theor. Comput. Sci.
- 2002

- Torben Hagerup, Tomasz Radzik
- SPAA
- 1990

Every Robust CRCW PRAM Can Efficiently Simulate a PRIORITY PRAM We show that an n-processor PRIORITY PRAM can be simulated with expected slowdown O(log logn) on any robust randomized n-processor PRAM. A PRAM is robust if it tolerates any write step, i.e., if it allows any number of processors to simultaneously attempt to write any combination of values to… (More)

- Tomasz Radzik
- Encyclopedia of Optimization
- 2009

- Tomasz Radzik
- Math. Oper. Res.
- 1993

We consider the generalized network flow problem. Each arc e in the network has a gain factor y (e ) . If f ( e ) units of flow enter arc e , then f ( e ) r ( e ) units arrive at the other end of e. The generalized network flow problem is to maximize the net flow into one specific node, the sink. -We give an algorithm which solves this problem in O(m2 (m +… (More)

- Bogdan S. Chlebus, Dariusz R. Kowalski, Tomasz Radzik
- Algorithmica
- 2007

Radio networks model wireless data communication when the bandwidth is limited to one wave frequency. The key restriction of such networks is mutual interference of packets arriving simultaneously at a node. The many-to-many (m2m) communication primitive involves p participant nodes from among n nodes in the network, where the distance between any pair of… (More)

A recommender system uses information about known associations between users and items to compute for a given user an ordered recommendation list of items which this user might be interested in acquiring. We consider ordering rules based on various parameters of random walks on the graph representing associations between users and items. We experimentally… (More)

- Colin Cooper, Alan M. Frieze, Tomasz Radzik
- SIAM J. Discrete Math.
- 2009

We study properties of multiple random walks on a graph under various assumptions of interaction between the particles. To give precise results, we make the analysis for random regular graphs. The cover time of a random walk on a random r-regular graph was studied in [6], where it was shown with high probability (whp), that for r ≥ 3 the cover time is… (More)

- Pramod Chandra P. Bhatt, Krzysztof Diks, Torben Hagerup, V. C. Prasad, Tomasz Radzik, Sanjeev Saxena
- Inf. Comput.
- 1991