| 2008 |
|---|
| 130 | EE | Marek Chrobak,
Christoph Dürr,
Mathilde Hurand,
Julien Robert:
Algorithms for Temperature-Aware Task Scheduling in Microprocessor Systems.
AAIM 2008: 120-130 |
| 129 | EE | Marek Chrobak:
Algorithm DC-Tree for kServers on Trees.
Encyclopedia of Algorithms 2008 |
| 128 | EE | Marek Chrobak:
Work-Function Algorithm for k Servers.
Encyclopedia of Algorithms 2008 |
| 127 | EE | Marek Chrobak,
Claire Kenyon,
John Noga,
Neal E. Young:
Incremental Medians via Online Bidding.
Algorithmica 50(4): 455-478 (2008) |
| 126 | EE | Wojciech Jawor,
Marek Chrobak,
Christoph Dürr:
Competitive Analysis of Scheduling Algorithms for Aggregated Links.
Algorithmica 51(4): 367-386 (2008) |
| 125 | EE | Marek Chrobak,
Christoph Dürr,
Mathilde Hurand,
Julien Robert:
Algorithms for Temperature-Aware Task Scheduling in Microprocessor Systems
CoRR abs/0801.4238: (2008) |
| 124 | EE | Marcin Bienkowski,
Marek Chrobak,
Christoph Dürr,
Mathilde Hurand,
Artur Jez,
Lukasz Jez,
Jakub Lopuszanski,
Grzegorz Stachowiak:
Generalized Whac-a-Mole
CoRR abs/0802.1685: (2008) |
| 2007 |
|---|
| 123 | EE | Qi Fu,
Elizabeth Bent,
James Borneman,
Marek Chrobak,
Neal E. Young:
Algorithmic Approaches to Selecting Control Clones in DNA Array Hybridization Experiments.
APBC 2007: 17-26 |
| 122 | EE | Philippe Baptiste,
Marek Chrobak,
Christoph Dürr:
Polynomial Time Algorithms for Minimum Energy Scheduling.
ESA 2007: 136-150 |
| 121 | EE | Marek Chrobak,
Mathilde Hurand,
Jiri Sgall:
Fast Algorithms for Testing Fault-Tolerance of Sequenced Jobs with Deadlines.
RTSS 2007: 139-148 |
| 120 | EE | Marek Chrobak,
Mathilde Hurand:
Better Bounds for Incremental Medians.
WAOA 2007: 207-217 |
| 119 | EE | Marek Chrobak,
Wojciech Jawor,
Jiri Sgall,
Tomás Tichý:
Improved online algorithms for buffer management in QoS switches.
ACM Transactions on Algorithms 3(4): (2007) |
| 118 | EE | Vaishnavi Krishnamurthy,
Michalis Faloutsos,
Marek Chrobak,
Jun-Hong Cui,
Li Lao,
Allon G. Percus:
Sampling large Internet topologies for simulation purposes.
Computer Networks 51(15): 4284-4302 (2007) |
| 117 | EE | Qi Fu,
Elizabeth Bent,
James Borneman,
Marek Chrobak,
Neal E. Young:
Algorithmic Approaches to Selecting Control Clones in DNA Array Hybridization Experiments.
J. Bioinformatics and Computational Biology 5(4): 937-961 (2007) |
| 116 | EE | Philippe Baptiste,
Peter Brucker,
Marek Chrobak,
Christoph Dürr,
Svetlana A. Kravchenko,
Francis Sourd:
The complexity of mean flow time scheduling problems with release times.
J. Scheduling 10(2): 139-146 (2007) |
| 115 | EE | Marek Chrobak,
Leszek Gasieniec,
Dariusz R. Kowalski:
The Wake-Up Problem in MultiHop Radio Networks.
SIAM J. Comput. 36(5): 1453-1471 (2007) |
| 114 | EE | Marek Chrobak,
Wojciech Jawor,
Jiri Sgall,
Tomás Tichý:
Online Scheduling of Equal-Length Jobs: Randomization and Restarts Help.
SIAM J. Comput. 36(6): 1709-1728 (2007) |
| 113 | EE | Marek Chrobak:
Competitiveness via primal-dual.
SIGACT News 38(3): 100-105 (2007) |
| 2006 |
|---|
| 112 | EE | Marek Chrobak,
Claire Kenyon,
John Noga,
Neal E. Young:
Oblivious Medians Via Online Bidding.
LATIN 2006: 311-322 |
| 111 | EE | Wojciech Jawor,
Marek Chrobak,
Christoph Dürr:
Competitive Analysis of Scheduling Algorithms for Aggregated Links.
LATIN 2006: 617-628 |
| 110 | EE | Lan Gao,
Jun Yang,
Marek Chrobak,
Youtao Zhang,
San Nguyen,
Hsien-Hsin S. Lee:
A low-cost memory remapping scheme for address bus protection.
PACT 2006: 74-83 |
| 109 | EE | Philippe Baptiste,
Peter Brucker,
Marek Chrobak,
Christoph Dürr,
Svetlana A. Kravchenko,
Francis Sourd:
The Complexity of Mean Flow Time Scheduling Problems with Release Times
CoRR abs/cs/0605078: (2006) |
| 108 | EE | Marek Chrobak,
Claire Kenyon,
Neal E. Young:
The reverse greedy algorithm for the metric k-median problem.
Inf. Process. Lett. 97(2): 68-72 (2006) |
| 107 | EE | Francis Y. L. Chin,
Marek Chrobak,
Stanley P. Y. Fung,
Wojciech Jawor,
Jiri Sgall,
Tomás Tichý:
Online competitive algorithms for maximizing weighted throughput of unit jobs.
J. Discrete Algorithms 4(2): 255-276 (2006) |
| 106 | EE | Marek Chrobak,
Christoph Dürr,
Wojciech Jawor,
Lukasz Kowalik,
Maciej Kurowski:
A Note on Scheduling Equal-Length Jobs to Maximize Throughput.
J. Scheduling 9(1): 71-73 (2006) |
| 105 | EE | Marek Chrobak:
2005: an offline persepctive.
SIGACT News 37(1): 82-98 (2006) |
| 104 | EE | Marek Chrobak,
Claire Kenyon-Mathieu:
SIGACT news online algorithms column 10: competitiveness via doubling.
SIGACT News 37(4): 115-126 (2006) |
| 2005 |
|---|
| 103 | EE | Marek Chrobak,
Claire Kenyon,
Neal E. Young:
The Reverse Greedy Algorithm for the Metric K-Median Problem.
COCOON 2005: 654-660 |
| 102 | EE | Vaishnavi Krishnamurthy,
Michalis Faloutsos,
Marek Chrobak,
Li Lao,
Jun-Hong Cui,
Allon G. Percus:
Reducing Large Internet Topologies for Faster Simulations.
NETWORKING 2005: 328-341 |
| 101 | EE | Marek Chrobak,
Petr Kolman,
Jiri Sgall:
The greedy algorithm for the minimum common string partition problem.
ACM Transactions on Algorithms 1(2): 350-366 (2005) |
| 100 | EE | Marek Chrobak,
Claire Kenyon,
John Noga,
Neal E. Young:
Oblivious Medians via Online Bidding
CoRR abs/cs/0504103: (2005) |
| 99 | EE | Marek Chrobak,
Claire Kenyon,
Neal E. Young:
The reverse greedy algorithm for the metric k-median problem
CoRR abs/cs/0504104: (2005) |
| 98 | EE | Marek Chrobak:
SIGACT news online algorithms column 8.
SIGACT News 36(3): 67 (2005) |
| 2004 |
|---|
| 97 | EE | Marek Chrobak,
Petr Kolman,
Jiri Sgall:
The Greedy Algorithm for the Minimum Common String Partition Problem.
APPROX-RANDOM 2004: 84-95 |
| 96 | EE | Marek Chrobak,
Wojciech Jawor,
Jiri Sgall,
Tomás Tichý:
Improved Online Algorithms for Buffer Management in QoS Switches.
ESA 2004: 204-215 |
| 95 | EE | Marek Chrobak,
Wojciech Jawor,
Jiri Sgall,
Tomás Tichý:
Online Scheduling of Equal-Length Jobs: Randomization and Restarts Help.
ICALP 2004: 358-370 |
| 94 | EE | Marek Chrobak,
Leszek Gasieniec,
Dariusz R. Kowalski:
The wake-up problem in multi-hop radio networks.
SODA 2004: 992-1000 |
| 93 | EE | Yair Bartal,
Francis Y. L. Chin,
Marek Chrobak,
Stanley P. Y. Fung,
Wojciech Jawor,
Ron Lavi,
Jiri Sgall,
Tomás Tichý:
Online Competitive Algorithms for Maximizing Weighted Throughput of Unit Jobs.
STACS 2004: 187-198 |
| 92 | EE | Marek Chrobak,
Jiri Sgall:
Errata to Analysis of the Harmonic Algorithm for Three Servers.
STACS 2004: 656 |
| 91 | EE | Philippe Baptiste,
Marek Chrobak,
Christoph Dürr,
Francis Sourd:
Preemptive Multi-Machine Scheduling of Equal-Length Jobs to Minimize the Average Flow Time
CoRR abs/cs/0412094: (2004) |
| 90 | EE | Marek Chrobak,
Christoph Dürr,
Wojciech Jawor,
Lukasz Kowalik,
Maciej Kurowski:
A Note on Scheduling Equal-Length Jobs to Maximize Throughput
CoRR cs.DS/0410046: (2004) |
| 89 | EE | Marek Chrobak,
Leszek Gasieniec,
Wojciech Rytter:
A randomized algorithm for gossiping in radio networks.
Networks 43(2): 119-124 (2004) |
| 88 | EE | Philippe Baptiste,
Marek Chrobak,
Christoph Dürr,
Wojciech Jawor,
Nodari Vakhania:
Preemptive scheduling of equal-length jobs to maximize weighted throughput.
Oper. Res. Lett. 32(3): 258-264 (2004) |
| 87 | EE | Marek Chrobak:
SIGACT news online algorithms column 2.
SIGACT News 35(1): 38-48 (2004) |
| 86 | EE | Marek Chrobak:
A princess swimming in the fog looking for a monster cow.
SIGACT News 35(2): 74-78 (2004) |
| 85 | EE | Marek Chrobak:
SIGACT news online algorithms column 4.
SIGACT News 35(3): 58-66 (2004) |
| 84 | EE | Marek Chrobak,
Elias Koutsoupias:
Coordination mechanisms for congestion games.
SIGACT News 35(4): 58-71 (2004) |
| 83 | EE | Marek Chrobak,
Jiri Sgall:
The weighted 2-server problem.
Theor. Comput. Sci. 324(2-3): 289-312 (2004) |
| 2003 |
|---|
| 82 | EE | Robert Benkoczi,
Binay K. Bhattacharya,
Marek Chrobak,
Lawrence L. Larmore,
Wojciech Rytter:
Faster Algorithms for k-Medians in Trees.
MFCS 2003: 218-227 |
| 81 | EE | Marek Chrobak,
Jiri Sgall:
Analysis of the Harmonic Algorithm for Three Servers.
STACS 2003: 247-259 |
| 80 | EE | Marek Chrobak,
Leah Epstein,
John Noga,
Jiri Sgall,
Rob van Stee,
Tomás Tichý,
Nodari Vakhania:
Preemptive scheduling in overloaded systems.
J. Comput. Syst. Sci. 67(1): 183-197 (2003) |
| 79 | | Marek Chrobak,
Elias Koutsoupias,
John Noga:
More on randomized on-line algorithms for caching.
Theor. Comput. Sci. 290(3): 1997-2008 (2003) |
| 78 | | Marek Chrobak,
Peter Couperus,
Christoph Dürr,
Gerhard J. Woeginger:
On tiling under tomographic constraints.
Theor. Comput. Sci. 290(3): 2125-2136 (2003) |
| 2002 |
|---|
| 77 | EE | Marek Chrobak,
Leah Epstein,
John Noga,
Jiri Sgall,
Rob van Stee,
Tomás Tichý,
Nodari Vakhania:
Preemptive Scheduling in Overloaded Systems.
ICALP 2002: 800-811 |
| 76 | EE | Philippe Baptiste,
Marek Chrobak,
Christoph Dürr,
Wojciech Jawor,
Nodari Vakhania:
Preemptive Scheduling of Equal-Length Jobs to Maximize Weighted Throughput
CoRR cs.DS/0209033: (2002) |
| 75 | EE | Yair Bartal,
Marek Chrobak,
John Noga,
Prabhakar Raghavan:
More on random walks, electrical networks, and the harmonic k-server algorithm.
Inf. Process. Lett. 84(5): 271-276 (2002) |
| 74 | EE | Marek Chrobak,
Leszek Gasieniec,
Wojciech Rytter:
Fast broadcasting and gossiping in radio networks.
J. Algorithms 43(2): 177-189 (2002) |
| 73 | | Eric Anderson,
Marek Chrobak,
John Noga,
Jiri Sgall,
Gerhard J. Woeginger:
Solution of a problem in DNA computing.
Theor. Comput. Sci. 287(2): 387-391 (2002) |
| 72 | | Wolfgang W. Bein,
Marek Chrobak,
Lawrence L. Larmore:
The 3-server problem in the plane.
Theor. Comput. Sci. 289(1): 335-354 (2002) |
| 2001 |
|---|
| 71 | EE | Marek Chrobak,
Leszek Gasieniec,
Wojciech Rytter:
A Randomized Algorithm for Gossiping in Radio Networks.
COCOON 2001: 483-492 |
| 70 | EE | Marek Chrobak,
János Csirik,
Csanád Imreh,
John Noga,
Jiri Sgall,
Gerhard J. Woeginger:
The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts.
ICALP 2001: 862-874 |
| 69 | | James Borneman,
Marek Chrobak,
Gianluca Della Vedova,
Andres Figueroa,
Tao Jiang:
Probe selection algorithms with applications in the analysis of microbial communities.
ISMB (Supplement of Bioinformatics) 2001: 39-48 |
| 68 | EE | Marek Chrobak,
Lawrence L. Larmore,
Wojciech Rytter:
The k-Median Problem for Directed Trees.
MFCS 2001: 260-271 |
| 67 | EE | Marek Chrobak,
Peter Couperus,
Christoph Dürr,
Gerhard J. Woeginger:
A Note on Tiling under Tomographic Constraints
CoRR cs.CC/0108010: (2001) |
| 66 | EE | Marek Chrobak,
Christoph Dürr:
Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms.
Theor. Comput. Sci. 259(1-2): 81-98 (2001) |
| 2000 |
|---|
| 65 | | Marek Chrobak,
Leszek Gasieniec,
Wojciech Rytter:
Fast Broadcasting and Gossiping in Radio Networks.
FOCS 2000: 575-581 |
| 64 | EE | Marek Chrobak,
Jiri Sgall:
The Weighted 2-Server Problem.
STACS 2000: 593-604 |
| 63 | | Qi Cheng,
Marek Chrobak,
Gopalakrishnan Sundaram:
Computing simple paths among obstacles.
Comput. Geom. 16(4): 223-233 (2000) |
| 62 | | Yair Bartal,
Marek Chrobak,
Lawrence L. Larmore:
A Randomized Algorithm for Two Servers on the Line.
Inf. Comput. 158(1): 53-69 (2000) |
| 61 | EE | Marek Chrobak,
Jiri Sgall:
A simple analysis of the harmonic algorithm for two servers.
Inf. Process. Lett. 75(1-2): 75-77 (2000) |
| 60 | | Marek Chrobak,
John Noga:
Competitive Algorithms for Relaxed List Update and Multilevel Caching.
J. Algorithms 34(2): 282-308 (2000) |
| 59 | EE | Dimitris Achlioptas,
Marek Chrobak,
John Noga:
Competitive analysis of randomized paging algorithms.
Theor. Comput. Sci. 234(1-2): 203-218 (2000) |
| 1999 |
|---|
| 58 | EE | Wolfgang W. Bein,
Marek Chrobak,
Lawrence L. Larmore:
The 3-Server Problem in the Plane.
ESA 1999: 301-312 |
| 57 | EE | Marek Chrobak,
John Noga:
LRU Is Better than FIFO.
Algorithmica 23(2): 180-185 (1999) |
| 56 | EE | Christoph Dürr,
Marek Chrobak:
Reconstructing Polyatomic Structures from Discrete X-Rays: NP-Completeness Proof for Three Atoms
CoRR cs.DS/9906018: (1999) |
| 55 | EE | Christoph Dürr,
Marek Chrobak:
Reconstructing hv-Convex Polyominoes from Orthogonal Projections
CoRR cs.DS/9906021: (1999) |
| 54 | EE | Marek Chrobak,
Christoph Dürr:
Reconstructing hv-Convex Polyominoes from Orthogonal Projections.
Inf. Process. Lett. 69(6): 283-289 (1999) |
| 1998 |
|---|
| 53 | EE | Yair Bartal,
Marek Chrobak,
Lawrence L. Larmore:
A Randomized Algorithm for Two Servers on the Line (Extended Abstract).
ESA 1998: 247-258 |
| 52 | EE | Marek Chrobak,
Christoph Dürr:
Reconstructing Polyatomic Structures from Discrete X-Rays: NP-Completeness Proof for Three Atoms.
MFCS 1998: 185-193 |
| 51 | | Marek Chrobak,
John Noga:
LRU is Better than FIFO.
SODA 1998: 78-81 |
| 50 | | Marek Chrobak,
John Noga:
Competive Algorithms for Multilevel Caching and Relaxed List Update (Extended Abstract).
SODA 1998: 87-96 |
| 49 | | Marek Chrobak,
Shin-Ichi Nakano:
Minimum-width grid drawings of plane graphs.
Comput. Geom. 11(1): 29-54 (1998) |
| 1997 |
|---|
| 48 | EE | Marek Chrobak,
Lawrence L. Larmore,
Carsten Lund,
Nick Reingold:
A Better Lower Bound on the Competitive Ratio of the Randomized 2-Server Problem.
Inf. Process. Lett. 63(2): 79-83 (1997) |
| 47 | | Marek Chrobak,
Goos Kant:
Convex Grid Drawings of 3-Connected Planar Graphs.
Int. J. Comput. Geometry Appl. 7(3): 211-223 (1997) |
| 46 | | Marek Chrobak,
Lawrence L. Larmore,
Nick Reingold,
Jeffery Westbrook:
Page Migration Algorithms Using Work Functions.
J. Algorithms 24(1): 124-157 (1997) |
| 1996 |
|---|
| 45 | | Dimitris Achlioptas,
Marek Chrobak,
John Noga:
Competive Analysis of Randomized Paging Algorithms.
ESA 1996: 419-430 |
| 44 | | Marek Chrobak,
John Noga:
Bibliography on Competitive Algorithms.
Online Algorithms 1996: 395-436 |
| 43 | | Marek Chrobak,
Lawrence L. Larmore:
Metrical Task Systems, the Server Problem and the Work Function Algorithm.
Online Algorithms 1996: 74-96 |
| 42 | EE | Marek Chrobak,
Michael T. Goodrich,
Roberto Tamassia:
Convex Drawings of Graphs in Two and Three Dimensions (Preliminary Version).
Symposium on Computational Geometry 1996: 319-328 |
| 1995 |
|---|
| 41 | EE | Marek Chrobak,
T. H. Payne:
A Linear-Time Algorithm for Drawing a Planar Graph on a Grid.
Inf. Process. Lett. 54(4): 241-246 (1995) |
| 1994 |
|---|
| 40 | | Marek Chrobak,
Shin-Ichi Nakano:
Minimum-Width Grid Drawings of Plane Graphs.
Graph Drawing 1994: 104-110 |
| 39 | | Marek Chrobak,
Lawrence L. Larmore:
Generosity Helps or an 11-Competitive Algorithm for Three Servers.
J. Algorithms 16(2): 234-263 (1994) |
| 38 | | Marek Chrobak,
Wojciech Rytter:
Two Results on Linear Embeddings of Complete Binary Trees.
Theor. Comput. Sci. 136(2): 507-526 (1994) |
| 1993 |
|---|
| 37 | | Marek Chrobak,
Lawrence L. Larmore,
Nick Reingold,
Jeffery Westbrook:
Page Migration Algorithms Using Work Functions.
ISAAC 1993: 406-415 |
| 1992 |
|---|
| 36 | EE | Marek Chrobak,
Lawrence L. Larmore:
Generosity Helps, or an 11-Competitive Algorithm for Three Servers.
SODA 1992: 196-202 |
| 35 | | Marek Chrobak,
Lawrence L. Larmore:
Harmonic is 3-Competitive for Two Servers.
Theor. Comput. Sci. 98(2): 339-346 (1992) |
| 1991 |
|---|
| 34 | | Marek Chrobak,
David Eppstein,
Giuseppe F. Italiano,
Moti Yung:
Efficient Sequential and Parallel Algorithms for Computing Recovery Points in Trees and Paths.
SODA 1991: 158-167 |
| 33 | | Marek Chrobak,
Joseph Naor:
An Efficient Parallel Algorithm for Computing a Large Independent Set in Planar Graph.
Algorithmica 6(6): 801-815 (1991) |
| 32 | | Marek Chrobak,
Howard J. Karloff,
Tomasz Radzik:
Connectivity vs. Reachability
Inf. Comput. 91(2): 177-188 (1991) |
| 31 | | Marek Chrobak,
Lawrence L. Larmore:
A Note on the Server Problem and a Benevolent Adversary.
Inf. Process. Lett. 38(4): 173-175 (1991) |
| 30 | | Marek Chrobak,
Lawrence L. Larmore:
On Fast Algorithms for Two Servers.
J. Algorithms 12(4): 607-614 (1991) |
| 29 | | Marek Chrobak,
Lawrence L. Larmore:
An Optimal On-Line Algorithm for k-Servers on Trees.
SIAM J. Comput. 20(1): 144-148 (1991) |
| 28 | | Marek Chrobak,
Howard J. Karloff,
T. H. Payne,
Sundar Vishwanathan:
New Results on Server Problems.
SIAM J. Discrete Math. 4(2): 172-181 (1991) |
| 27 | | Marek Chrobak,
Lawrence L. Larmore:
A New Approach to the Server Problem.
SIAM J. Discrete Math. 4(3): 323-328 (1991) |
| 26 | | Marek Chrobak,
David Eppstein:
Planar Orientations with Low Out-degree and Compaction of Adjacency Matrices.
Theor. Comput. Sci. 86(2): 243-266 (1991) |
| 1990 |
|---|
| 25 | | Marek Chrobak,
Lawrence L. Larmore:
On Fast Algorithms for Two Servers.
MFCS 1990: 202-208 |
| 24 | | Marek Chrobak,
Howard J. Karloff,
T. H. Payne,
Sundar Vishwanathan:
title=New Results on Server Problems.
SODA 1990: 291-300 |
| 23 | | Marek Chrobak,
Takao Nishizeki:
Improved Edge-Coloring Algorithms for Planar Graphs.
J. Algorithms 11(1): 102-116 (1990) |
| 22 | | Marek Chrobak,
Tomasz Szymacha,
Adam Krawczyk:
A Data Structure Useful for Finding Hamiltonian Cycles.
Theor. Comput. Sci. 71(3): 419-424 (1990) |
| 1989 |
|---|
| 21 | EE | Marek Chrobak,
Joseph Naor:
An Efficient Parallel Algorithm for Computing a Large Independent Set in a Plan Graph.
SPAA 1989: 379-387 |
| 20 | | Marek Chrobak,
Joseph Naor,
Mark B. Novick:
Using Bounded Degree Spanning Trees in the Design of Efficient Algorihtms on Claw-Free Graphs.
WADS 1989: 147-162 |
| 19 | | Marek Chrobak,
Moti Yung:
Fast Algorithms for Edge-Coloring Planar Graphs.
J. Algorithms 10(1): 35-51 (1989) |
| 18 | | Torben Hagerup,
Marek Chrobak,
Krzysztof Diks:
Optimal Parallel 5-Colouring of Planar Graphs.
SIAM J. Comput. 18(2): 288-300 (1989) |
| 1988 |
|---|
| 17 | | Marek Chrobak,
Moti Yung:
Fast Parallel and Sequential Algorithms for Edge-Coloring Planar Graphs.
AWOC 1988: 11-23 |
| 16 | | Marek Chrobak,
Maciej Slusarek:
On Some Packing Problem Related to Dynamic Storage Allocation.
ITA 22(4): 487-499 (1988) |
| 15 | | Marek Chrobak,
Richard Harter:
A Note on Random Sampling.
Inf. Process. Lett. 29(5): 255-256 (1988) |
| 14 | | Marek Chrobak,
Ming Li:
k+1 Heads Are Better than k for PDAs.
J. Comput. Syst. Sci. 37(2): 144-155 (1988) |
| 1987 |
|---|
| 13 | | Bogdan S. Chlebus,
Marek Chrobak,
Krzysztof Diks:
Saturating Flows in Networks.
FCT 1987: 82-91 |
| 12 | | Torben Hagerup,
Marek Chrobak,
Krzysztof Diks:
Parallel 5-Colouring of Planar Graphs.
ICALP 1987: 304-313 |
| 11 | | Marek Chrobak,
Wojciech Rytter:
Remarks on String-Matching and One-Way Multihead Automata.
Inf. Process. Lett. 24(5): 325-329 (1987) |
| 1986 |
|---|
| 10 | | Marek Chrobak,
Ming Li:
k+1 Heads Are Better than k for PDA's
FOCS 1986: 361-367 |
| 9 | | Marek Chrobak,
Wojciech Rytter:
Unique Deciperability for Partially Commutative Alphabet (Extended Abstract).
MFCS 1986: 256-263 |
| 8 | | Marek Chrobak:
Finite Automata and Unary Languages.
Theor. Comput. Sci. 47(3): 149-158 (1986) |
| 7 | | Marek Chrobak:
Hierarchies of One-Way Multihead Automata Languages.
Theor. Comput. Sci. 48(3): 153-181 (1986) |
| 1985 |
|---|
| 6 | | Marek Chrobak:
Hierarchies of One-Way Multihead Automata Languages.
ICALP 1985: 101-110 |
| 5 | | Marek Chrobak:
Variations on the Technique of Duris and Galil.
J. Comput. Syst. Sci. 30(1): 77-85 (1985) |
| 4 | | Wojciech Rytter,
Marek Chrobak:
A Characterization of Reversal-Bounded Multipushdown Machine Languages.
Theor. Comput. Sci. 36: 341-344 (1985) |
| 1984 |
|---|
| 3 | | Marek Chrobak:
Nondeterminism Is Essential for Two-Way Counter Machines.
MFCS 1984: 240-244 |
| 2 | | Marek Chrobak,
Bogdan S. Chlebus:
Probabilistic Turing Machines and Recursively Enumerable Dedekind Cuts.
Inf. Process. Lett. 19(4): 167-171 (1984) |
| 1 | | Marek Chrobak:
A Note on Bounded-Reversal Multipushdown Machines.
Inf. Process. Lett. 19(4): 179-180 (1984) |
