Bogdan S. Chlebus - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

2010

Deterministic Broadcast on Multiple Access ChannelsLakshmi Anantharamu, Bogdan S. Chlebus, Dariusz R. Kowalski, Mariusz A. Rokicki. infocom 2010: 146-150 [doi]

Scalable Quantum Consensus for Crash FailuresBogdan S. Chlebus, Dariusz R. Kowalski, Michal Strojnowski. wdag 2010: 236-250 [doi]

2009

2008

Asynchronous exclusive selectionBogdan S. Chlebus, Dariusz R. Kowalski. podc 2008: 375-384 [doi]

A robust randomized algorithm to perform independent tasksBogdan S. Chlebus, Leszek Gasieniec, Dariusz R. Kowalski, Alexander A. Shvartsman. jda, 6(4):651-665, 2008. [doi]

Distributed Computing in Sensor Systems, 4th IEEE International Conference, DCOSS 2008, Santorini Island, Greece, June 11-14, 2008, ProceedingsSotiris E. Nikoletseas, Bogdan S. Chlebus, David B. Johnson, Bhaskar Krishnamachari, editors, Volume 5067 of Lecture Notes in Computer Science, Springer, 2008.

2007

Centralized asynchronous broadcast in radio networksBogdan S. Chlebus, Mariusz A. Rokicki. TCS, 383(1):5-22, 2007. [doi]

Stability of the Multiple-Access Channel Under Maximum Broadcast LoadsBogdan S. Chlebus, Dariusz R. Kowalski, Mariusz A. Rokicki. sss 2007: 124-138 [doi]

2006

2005

Cooperative asynchronous update of shared memoryBogdan S. Chlebus, Dariusz R. Kowalski. stoc 2005: 733-739 [doi]

Almost Optimal Explicit SelectorsBogdan S. Chlebus, Dariusz R. Kowalski. fct 2005: 270-280 [doi]

On the Wake-Up Problem in Radio NetworksBogdan S. Chlebus, Leszek Gasieniec, Dariusz R. Kowalski, Tomasz Radzik. icalp 2005: 347-359 [doi]

2004

2003

Deterministic Computations on a PRAM with Static Processor and Memory FaultsBogdan S. Chlebus, Leszek Gasieniec, Andrzej Pelc. FUIN, 55(3-4):285-306, 2003. [doi]

Broadcasting Spanning Forests on a Multiple-Access ChannelBogdan S. Chlebus, Karol Golab, Dariusz R. Kowalski. mst, 36(6):711-733, 2003. [doi]

Routing on Meshes in Optimum Time and with Really Small QueuesBogdan S. Chlebus, Jop F. Sibeyn. ipps 2003: 56 [doi]

2002

2001

2000

1999

Randomization Helps to Perform Tasks on Processors Prone to FailuresBogdan S. Chlebus, Dariusz R. Kowalski. wdag 1999: 284-296 [doi]

1998

On Finding Optimal Discretizations for Two AttributesBogdan S. Chlebus, Sinh Hoa Nguyen. rsctc 1998: 537-544 [doi]

On the Klee s Measure Problem in Small DimensionsBogdan S. Chlebus. sofsem 1998: 304-311 [doi]

1997

Fundamentals of Computation Theory, 11th International Symposium, FCT 97, Kraków, Poland, September 1-3, 1997, ProceedingsBogdan S. Chlebus, Ludwik Czaja, editors, Volume 1279 of Lecture Notes in Computer Science, Springer, 1997.

Performing Tasks on Restartable Message-Passing ProcessorsBogdan S. Chlebus, Roberto De Prisco, Alexander A. Shvartsman. wdag 1997: 96-110

Transition-Optimal Token DistributionBogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc. FUIN, 32(3-4):313-328, 1997.

Mesh Sorting and Selection Optimal to the AverageBogdan S. Chlebus. cai, 16(2), 1997.

Routing on the PADAM: Degrees of OptimalityBogdan S. Chlebus, Artur Czumaj, Jop F. Sibeyn. europar 1997: 272-279

Deterministic Permutation Routing on MeshesJop F. Sibeyn, Bogdan S. Chlebus, Michael Kaufmann. jal, 22(1):111-141, 1997.

1996

1995

O(log log n)-Time Integer Geometry on the CRCW PRAMBogdan S. Chlebus, Krzysztof Diks, Miroslaw Kowaluk. algorithmica, 14(1):52-69, 1995.

Fast Deterministic Simulation of Computations on Faulty Parallel MachinesBogdan S. Chlebus, Leszek Gasieniec, Andrzej Pelc. esa 1995: 89-101

1994

1993

Sparse Networks Supporting Efficient Reliable BroadcastingBogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc. icalp 1993: 388-397

Deterministic Permutation Routing on MeshesBogdan S. Chlebus, Michael Kaufmann, Jop F. Sibeyn. spdp 1993: 284

1992

Two Selection Algorithms on a Mesh-Connected ComputerBogdan S. Chlebus. ppl, 2:341-346, 1992.

1991

Optimal Broadcasting in Faulty HypercubesBogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc. ftcs 1991: 266-273

Parallel QuicksortBogdan S. Chlebus, Imrich Vrto. jpdc, 11(4):332-337, 1991.

Duplicating keys to streamline sorting on a mesh-connected computerBogdan S. Chlebus. spdp 1991: 296-300 [doi]

Unifying Binary-Search Trees and PermutationsBogdan S. Chlebus, Imrich Vrto. fct 1991: 190-199

1990

Sorting Roughly Sorted Sequences in ParallelTom Altman, Bogdan S. Chlebus. ipl, 33(6):297-300, 1990.

Turing Machines With Access to HistoryBogdan S. Chlebus. iandc, 89(2):133-143, December 1990.

1989

1988

Efficient Simulations Between Concurrent-Read Concurrent-Write PRAM ModelsBogdan S. Chlebus, Krzysztof Diks, Torben Hagerup, Tomasz Radzik. mfcs 1988: 231-239

A Parallel Bucket SortBogdan S. Chlebus. ipl, 27(2):57-61, 1988.

Testing Isomorphism of Outerplanar Graphs in ParallelBogdan S. Chlebus, Krzysztof Diks, Tomasz Radzik. mfcs 1988: 220-230

1987

A note on the polynomial-time hierarchy and the quantified Boolean formulasBogdan S. Chlebus. eatcs, 31:15-21, 1987.

Proving NP-completeness Using BOUNDED TILINGBogdan S. Chlebus. eik, 23(8/9):479-484, 1987.

Saturating Flows in NetworksBogdan S. Chlebus, Marek Chrobak, Krzysztof Diks. fct 1987: 82-91

1986

Domino-Tiling GamesBogdan S. Chlebus. jcss, 32(3):374-392, 1986.

1985

Algorithms solving path systemsBogdan S. Chlebus. fct 1985: 70-79

1984

From domino tilings to a new model of computationBogdan S. Chlebus. sct 1985: 24-33 [doi]

Probabilistic Turing Machines and Recursively Enumerable Dedekind CutsMarek Chrobak, Bogdan S. Chlebus. ipl, 19(4):167-171, 1984.

1982

On the Computational Complexity of Satisfiability in Propositional Logics of ProgramsBogdan S. Chlebus. TCS, 21:179-212, 1982.

1980

On four logics of programs and complexity of their satisfiability problems: extended abstractBogdan S. Chlebus. lop 1983: 98-107