dblp.uni-trier.dewww.uni-trier.de

Marek Chrobak Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
142EEFrancis Y. L. Chin, Marek Chrobak, Li Yan: Algorithms for Placing Monitors in a Flow Network. AAIM 2009: 114-128
141EEMarek Chrobak, Jiri Sgall: Three Results on Frequency Assignment in Linear Cellular Networks. AAIM 2009: 129-139
140EEMarcin Bienkowski, Marek Chrobak, Christoph Dürr, Mathilde Hurand, Artur Jez, Lukasz Jez, Grzegorz Stachowiak: Collecting weighted items from a dynamic queue. SODA 2009: 1126-1135
139EEPhilippe Baptiste, Marek Chrobak, Christoph Dürr: Polynomial Time Algorithms for Minimum Energy Scheduling CoRR abs/0908.3505: (2009)
138EEFrancis Y. L. Chin, Marek Chrobak, Li Yan: Algorithms for Placing Monitors in a Flow Network CoRR abs/0908.4309: (2009)
137EEMarek Chrobak, Mathilde Hurand, Jiri Sgall: Algorithms for testing fault-tolerance of sequenced jobs. J. Scheduling 12(5): 501-515 (2009)
2008
136EEMarek Chrobak, Christoph Dürr, Mathilde Hurand, Julien Robert: Algorithms for Temperature-Aware Task Scheduling in Microprocessor Systems. AAIM 2008: 120-130
135EEYihua He, Michalis Faloutsos, Srikanth V. Krishnamurthy, Marek Chrobak: Policy-Aware Topologies for Efficient Inter-Domain Routing Evaluations. INFOCOM 2008: 2342-2350
134EEJun Yang, Xiuyi Zhou, Marek Chrobak, Youtao Zhang, Lingling Jin: Dynamic Thermal Management through Task Scheduling. ISPASS 2008: 191-201
133EEWojciech Jawor, Marek Chrobak, Mart Molle: Experimental Analysis of Scheduling Algorithms for Aggregated Links. WAOA 2008: 253-266
132EEMarcin Bienkowski, Marek Chrobak, Lukasz Jez: Randomized Algorithms for Buffer Management with 2-Bounded Delay. WAOA 2008: 92-104
131EEMarek Chrobak: Algorithm DC-Tree for kServers on Trees. Encyclopedia of Algorithms 2008
130EEMarek Chrobak: Work-Function Algorithm for k Servers. Encyclopedia of Algorithms 2008
129EEMarek Chrobak, Claire Kenyon, John Noga, Neal E. Young: Incremental Medians via Online Bidding. Algorithmica 50(4): 455-478 (2008)
128EEWojciech Jawor, Marek Chrobak, Christoph Dürr: Competitive Analysis of Scheduling Algorithms for Aggregated Links. Algorithmica 51(4): 367-386 (2008)
127EEMarek Chrobak, Christoph Dürr, Mathilde Hurand, Julien Robert: Algorithms for Temperature-Aware Task Scheduling in Microprocessor Systems CoRR abs/0801.4238: (2008)
126EEMarcin 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)
125EEMarek Chrobak: SIGACT news online algorithms column 13: 2007 - an offine perspective. SIGACT News 39(3): 96-121 (2008)
2007
124EEQi 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
123EEPhilippe Baptiste, Marek Chrobak, Christoph Dürr: Polynomial Time Algorithms for Minimum Energy Scheduling. ESA 2007: 136-150
122EEMarek Chrobak, Mathilde Hurand, Jiri Sgall: Fast Algorithms for Testing Fault-Tolerance of Sequenced Jobs with Deadlines. RTSS 2007: 139-148
121EEMarek Chrobak, Mathilde Hurand: Better Bounds for Incremental Medians. WAOA 2007: 207-217
120EEMarek Chrobak, Wojciech Jawor, Jiri Sgall, Tomás Tichý: Improved online algorithms for buffer management in QoS switches. ACM Transactions on Algorithms 3(4): (2007)
119EEVaishnavi 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)
118EEQi 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)
117EEPhilippe 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)
116EEMarek Chrobak, Leszek Gasieniec, Dariusz R. Kowalski: The Wake-Up Problem in MultiHop Radio Networks. SIAM J. Comput. 36(5): 1453-1471 (2007)
115EEMarek 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)
114EEMarek Chrobak: Competitiveness via primal-dual. SIGACT News 38(3): 100-105 (2007)
2006
113EEMarek Chrobak, Claire Kenyon, John Noga, Neal E. Young: Oblivious Medians Via Online Bidding. LATIN 2006: 311-322
112EEWojciech Jawor, Marek Chrobak, Christoph Dürr: Competitive Analysis of Scheduling Algorithms for Aggregated Links. LATIN 2006: 617-628
111EELan 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
110EEPhilippe 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)
109EEMarek Chrobak, Claire Kenyon, Neal E. Young: The reverse greedy algorithm for the metric k-median problem. Inf. Process. Lett. 97(2): 68-72 (2006)
108EEFrancis 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)
107EEMarek 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)
106EEMarek Chrobak: 2005: an offline persepctive. SIGACT News 37(1): 82-98 (2006)
105EEMarek Chrobak, Claire Kenyon-Mathieu: SIGACT news online algorithms column 10: competitiveness via doubling. SIGACT News 37(4): 115-126 (2006)
2005
104EEMarek Chrobak, Claire Kenyon, Neal E. Young: The Reverse Greedy Algorithm for the Metric K-Median Problem. COCOON 2005: 654-660
103EEVaishnavi Krishnamurthy, Michalis Faloutsos, Marek Chrobak, Li Lao, Jun-Hong Cui, Allon G. Percus: Reducing Large Internet Topologies for Faster Simulations. NETWORKING 2005: 328-341
102EEMarek Chrobak, Petr Kolman, Jiri Sgall: The greedy algorithm for the minimum common string partition problem. ACM Transactions on Algorithms 1(2): 350-366 (2005)
101EEMarek Chrobak, Claire Kenyon, John Noga, Neal E. Young: Oblivious Medians via Online Bidding CoRR abs/cs/0504103: (2005)
100EEMarek Chrobak, Claire Kenyon, Neal E. Young: The reverse greedy algorithm for the metric k-median problem CoRR abs/cs/0504104: (2005)
99EEMarek Chrobak: SIGACT news online algorithms column 8. SIGACT News 36(3): 67 (2005)
2004
98EEMarek Chrobak, Petr Kolman, Jiri Sgall: The Greedy Algorithm for the Minimum Common String Partition Problem. APPROX-RANDOM 2004: 84-95
97EEMarek Chrobak, Wojciech Jawor, Jiri Sgall, Tomás Tichý: Improved Online Algorithms for Buffer Management in QoS Switches. ESA 2004: 204-215
96EEMarek Chrobak, Wojciech Jawor, Jiri Sgall, Tomás Tichý: Online Scheduling of Equal-Length Jobs: Randomization and Restarts Help. ICALP 2004: 358-370
95EEMarek Chrobak, Leszek Gasieniec, Dariusz R. Kowalski: The wake-up problem in multi-hop radio networks. SODA 2004: 992-1000
94EEYair 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
93EEMarek Chrobak, Jiri Sgall: Errata to Analysis of the Harmonic Algorithm for Three Servers. STACS 2004: 656
92EEPhilippe 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)
91EEMarek 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)
90EEMarek Chrobak, Leszek Gasieniec, Wojciech Rytter: A randomized algorithm for gossiping in radio networks. Networks 43(2): 119-124 (2004)
89EEPhilippe 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)
88EEMarek Chrobak: SIGACT news online algorithms column 2. SIGACT News 35(1): 38-48 (2004)
87EEMarek Chrobak: A princess swimming in the fog looking for a monster cow. SIGACT News 35(2): 74-78 (2004)
86EEMarek Chrobak: SIGACT news online algorithms column 4. SIGACT News 35(3): 58-66 (2004)
85EEMarek Chrobak, Elias Koutsoupias: Coordination mechanisms for congestion games. SIGACT News 35(4): 58-71 (2004)
84EEMarek Chrobak, Jiri Sgall: The weighted 2-server problem. Theor. Comput. Sci. 324(2-3): 289-312 (2004)
2003
83EERobert Benkoczi, Binay K. Bhattacharya, Marek Chrobak, Lawrence L. Larmore, Wojciech Rytter: Faster Algorithms for k-Medians in Trees. MFCS 2003: 218-227
82EEMarek Chrobak, Jiri Sgall: Analysis of the Harmonic Algorithm for Three Servers. STACS 2003: 247-259
81EEMarek 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)
80 Marek Chrobak, Elias Koutsoupias, John Noga: More on randomized on-line algorithms for caching. Theor. Comput. Sci. 290(3): 1997-2008 (2003)
79 Marek Chrobak, Peter Couperus, Christoph Dürr, Gerhard J. Woeginger: On tiling under tomographic constraints. Theor. Comput. Sci. 290(3): 2125-2136 (2003)
2002
78EEMarek Chrobak, Leah Epstein, John Noga, Jiri Sgall, Rob van Stee, Tomás Tichý, Nodari Vakhania: Preemptive Scheduling in Overloaded Systems. ICALP 2002: 800-811
77EEPhilippe 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)
76EEYair 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)
75EEMarek Chrobak, Leszek Gasieniec, Wojciech Rytter: Fast broadcasting and gossiping in radio networks. J. Algorithms 43(2): 177-189 (2002)
74 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)
73 Wolfgang W. Bein, Marek Chrobak, Lawrence L. Larmore: The 3-server problem in the plane. Theor. Comput. Sci. 289(1): 335-354 (2002)
2001
72EEMarek Chrobak, Leszek Gasieniec, Wojciech Rytter: A Randomized Algorithm for Gossiping in Radio Networks. COCOON 2001: 483-492
71EEMarek 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
70 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
69EEMarek Chrobak, Lawrence L. Larmore, Wojciech Rytter: The k-Median Problem for Directed Trees. MFCS 2001: 260-271
68EEMarek Chrobak, Peter Couperus, Christoph Dürr, Gerhard J. Woeginger: A Note on Tiling under Tomographic Constraints CoRR cs.CC/0108010: (2001)
67EEMarek 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
66 Marek Chrobak, Leszek Gasieniec, Wojciech Rytter: Fast Broadcasting and Gossiping in Radio Networks. FOCS 2000: 575-581
65EEMarek Chrobak, Jiri Sgall: The Weighted 2-Server Problem. STACS 2000: 593-604
64 Qi Cheng, Marek Chrobak, Gopalakrishnan Sundaram: Computing simple paths among obstacles. Comput. Geom. 16(4): 223-233 (2000)
63 Yair Bartal, Marek Chrobak, Lawrence L. Larmore: A Randomized Algorithm for Two Servers on the Line. Inf. Comput. 158(1): 53-69 (2000)
62EEMarek Chrobak, Jiri Sgall: A simple analysis of the harmonic algorithm for two servers. Inf. Process. Lett. 75(1-2): 75-77 (2000)
61 Marek Chrobak, John Noga: Competitive Algorithms for Relaxed List Update and Multilevel Caching. J. Algorithms 34(2): 282-308 (2000)
60EEDimitris Achlioptas, Marek Chrobak, John Noga: Competitive analysis of randomized paging algorithms. Theor. Comput. Sci. 234(1-2): 203-218 (2000)
1999
59EEWolfgang W. Bein, Marek Chrobak, Lawrence L. Larmore: The 3-Server Problem in the Plane. ESA 1999: 301-312
58EEMarek Chrobak, John Noga: LRU Is Better than FIFO. Algorithmica 23(2): 180-185 (1999)
57EEChristoph Dürr, Marek Chrobak: Reconstructing Polyatomic Structures from Discrete X-Rays: NP-Completeness Proof for Three Atoms CoRR cs.DS/9906018: (1999)
56EEChristoph Dürr, Marek Chrobak: Reconstructing hv-Convex Polyominoes from Orthogonal Projections CoRR cs.DS/9906021: (1999)
55EEMarek Chrobak, Christoph Dürr: Reconstructing hv-Convex Polyominoes from Orthogonal Projections. Inf. Process. Lett. 69(6): 283-289 (1999)
1998
54EEYair Bartal, Marek Chrobak, Lawrence L. Larmore: A Randomized Algorithm for Two Servers on the Line (Extended Abstract). ESA 1998: 247-258
53EEMarek Chrobak, Christoph Dürr: Reconstructing Polyatomic Structures from Discrete X-Rays: NP-Completeness Proof for Three Atoms. MFCS 1998: 185-193
52 Marek Chrobak, John Noga: LRU is Better than FIFO. SODA 1998: 78-81
51 Marek Chrobak, John Noga: Competive Algorithms for Multilevel Caching and Relaxed List Update (Extended Abstract). SODA 1998: 87-96
50 Marek Chrobak, Shin-Ichi Nakano: Minimum-width grid drawings of plane graphs. Comput. Geom. 11(1): 29-54 (1998)
1997
49EEMarek 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)
48 Marek Chrobak, Goos Kant: Convex Grid Drawings of 3-Connected Planar Graphs. Int. J. Comput. Geometry Appl. 7(3): 211-223 (1997)
47 Marek Chrobak, Lawrence L. Larmore, Nick Reingold, Jeffery Westbrook: Page Migration Algorithms Using Work Functions. J. Algorithms 24(1): 124-157 (1997)
1996
46EEDimitris Achlioptas, Marek Chrobak, John Noga: Competive Analysis of Randomized Paging Algorithms. ESA 1996: 419-430
45 Marek Chrobak, John Noga: Bibliography on Competitive Algorithms. Online Algorithms 1996: 395-436
44 Marek Chrobak, Lawrence L. Larmore: Metrical Task Systems, the Server Problem and the Work Function Algorithm. Online Algorithms 1996: 74-96
43EEMarek 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
42EEMarek 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
41 Marek Chrobak, Shin-Ichi Nakano: Minimum-Width Grid Drawings of Plane Graphs. Graph Drawing 1994: 104-110
40 Marek Chrobak, Lawrence L. Larmore: Generosity Helps or an 11-Competitive Algorithm for Three Servers. J. Algorithms 16(2): 234-263 (1994)
39 Marek Chrobak, Wojciech Rytter: Two Results on Linear Embeddings of Complete Binary Trees. Theor. Comput. Sci. 136(2): 507-526 (1994)
1993
38EEMarek Chrobak, Lawrence L. Larmore, Nick Reingold, Jeffery Westbrook: Page Migration Algorithms Using Work Functions. ISAAC 1993: 406-415
1992
37EEMarek Chrobak, Lawrence L. Larmore: Generosity Helps, or an 11-Competitive Algorithm for Three Servers. SODA 1992: 196-202
36 Marek Chrobak, Lawrence L. Larmore: Harmonic is 3-Competitive for Two Servers. Theor. Comput. Sci. 98(2): 339-346 (1992)
1991
35 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
34 Marek Chrobak, Joseph Naor: An Efficient Parallel Algorithm for Computing a Large Independent Set in Planar Graph. Algorithmica 6(6): 801-815 (1991)
33 Marek Chrobak, Howard J. Karloff, Tomasz Radzik: Connectivity vs. Reachability Inf. Comput. 91(2): 177-188 (1991)
32 Marek Chrobak, Lawrence L. Larmore: A Note on the Server Problem and a Benevolent Adversary. Inf. Process. Lett. 38(4): 173-175 (1991)
31 Marek Chrobak, Lawrence L. Larmore: On Fast Algorithms for Two Servers. J. Algorithms 12(4): 607-614 (1991)
30 Marek Chrobak, Lawrence L. Larmore: An Optimal On-Line Algorithm for k-Servers on Trees. SIAM J. Comput. 20(1): 144-148 (1991)
29 Marek Chrobak, Howard J. Karloff, T. H. Payne, Sundar Vishwanathan: New Results on Server Problems. SIAM J. Discrete Math. 4(2): 172-181 (1991)
28 Marek Chrobak, Lawrence L. Larmore: A New Approach to the Server Problem. SIAM J. Discrete Math. 4(3): 323-328 (1991)
27 Marek Chrobak, David Eppstein: Planar Orientations with Low Out-degree and Compaction of Adjacency Matrices. Theor. Comput. Sci. 86(2): 243-266 (1991)
1990
26EEMarek Chrobak, Lawrence L. Larmore: On Fast Algorithms for Two Servers. MFCS 1990: 202-208
25 Marek Chrobak, Howard J. Karloff, T. H. Payne, Sundar Vishwanathan: title=New Results on Server Problems. SODA 1990: 291-300
24 Marek Chrobak, Takao Nishizeki: Improved Edge-Coloring Algorithms for Planar Graphs. J. Algorithms 11(1): 102-116 (1990)
23 Marek Chrobak, Tomasz Szymacha, Adam Krawczyk: A Data Structure Useful for Finding Hamiltonian Cycles. Theor. Comput. Sci. 71(3): 419-424 (1990)
1989
22EEMarek Chrobak, Joseph Naor: An Efficient Parallel Algorithm for Computing a Large Independent Set in a Plan Graph. SPAA 1989: 379-387
21 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
20 Marek Chrobak, Moti Yung: Fast Algorithms for Edge-Coloring Planar Graphs. J. Algorithms 10(1): 35-51 (1989)
19 Torben Hagerup, Marek Chrobak, Krzysztof Diks: Optimal Parallel 5-Colouring of Planar Graphs. SIAM J. Comput. 18(2): 288-300 (1989)
1988
18 Marek Chrobak, Moti Yung: Fast Parallel and Sequential Algorithms for Edge-Coloring Planar Graphs. AWOC 1988: 11-23
17EEMarek Chrobak, Svatopluk Poljak: On common edges in optimal solutions to traveling salesman and other optimization problems. Discrete Applied Mathematics 20(2): 101-111 (1988)
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
12EETorben 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
9EEMarek 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
6EEMarek 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
3EEMarek 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)

Coauthor Index

1Dimitris Achlioptas [46] [60]
2Eric Anderson [74]
3Philippe Baptiste [77] [89] [92] [110] [117] [123] [139]
4Yair Bartal [54] [63] [76] [94]
5Wolfgang W. Bein [59] [73]
6Robert Benkoczi [83]
7Elizabeth Bent [118] [124]
8Binay K. Bhattacharya [83]
9Marcin Bienkowski [126] [132] [140]
10James Borneman [70] [118] [124]
11Peter Brucker [110] [117]
12Qi Cheng [64]
13Francis Y. L. Chin (Francis Yuk-Lun Chin) [94] [108] [138] [142]
14Bogdan S. Chlebus [2] [13]
15Peter Couperus [68] [79]
16János Csirik [71]
17Jun-Hong Cui [103] [119]
18Krzysztof Diks [12] [13] [19]
19Christoph Dürr [53] [55] [56] [57] [67] [68] [77] [79] [89] [91] [92] [107] [110] [112] [117] [123] [126] [127] [128] [136] [139] [140]
20David Eppstein [27] [35]
21Leah Epstein [78] [81]
22Michalis Faloutsos [103] [119] [135]
23Andres Figueroa [70]
24Qi Fu [118] [124]
25Stanley P. Y. Fung [94] [108]
26Lan Gao [111]
27Leszek Gasieniec [66] [72] [75] [90] [95] [116]
28Michael T. Goodrich [43]
29Torben Hagerup [12] [19]
30Richard Harter [15]
31Yihua He [135]
32Mathilde Hurand [121] [122] [126] [127] [136] [137] [140]
33Csanád Imreh [71]
34Giuseppe F. Italiano [35]
35Wojciech Jawor [77] [89] [91] [94] [96] [97] [107] [108] [112] [115] [120] [128] [133]
36Artur Jez [126] [140]
37Lukasz Jez [126] [132] [140]
38Tao Jiang [70]
39Lingling Jin [134]
40Goos Kant [48]
41Howard J. Karloff [25] [29] [33]
42Petr Kolman [98] [102]
43Elias Koutsoupias [80] [85]
44Lukasz Kowalik [91] [107]
45Dariusz R. Kowalski [95] [116]
46Svetlana A. Kravchenko [110] [117]
47Adam Krawczyk [23]
48Srikanth V. Krishnamurthy [135]
49Vaishnavi Krishnamurthy [103] [119]
50Maciej Kurowski [91] [107]
51Li Lao [103] [119]
52Lawrence L. Larmore [26] [28] [30] [31] [32] [36] [37] [38] [40] [44] [47] [49] [54] [59] [63] [69] [73] [83]
53Ron Lavi [94]
54Hsien-Hsin S. Lee [111]
55Ming Li [10] [14]
56Jakub Lopuszanski [126]
57Carsten Lund [49]
58Claire Mathieu (Claire Kenyon, Claire Kenyon-Mathieu) [100] [101] [104] [105] [109] [113] [129]
59Mart Molle (Mart L. Molle) [133]
60Shin-Ichi Nakano [41] [50]
61Joseph Naor (Seffi Naor) [21] [22] [34]
62San Nguyen [111]
63Takao Nishizeki [24]
64John Noga [45] [46] [51] [52] [58] [60] [61] [71] [74] [76] [78] [80] [81] [101] [113] [129]
65Mark B. Novick [21]
66Thomas H. Payne (T. H. Payne) [25] [29] [42]
67Allon G. Percus [103] [119]
68Svatopluk Poljak [17]
69Tomasz Radzik [33]
70Prabhakar Raghavan [76]
71Nick Reingold [38] [47] [49]
72Julien Robert [127] [136]
73Wojciech Rytter [4] [9] [11] [39] [66] [69] [72] [75] [83] [90]
74Jiri Sgall [62] [65] [71] [74] [78] [81] [82] [84] [93] [94] [96] [97] [98] [102] [108] [115] [120] [122] [137] [141]
75Maciej Slusarek [16]
76Francis Sourd [92] [110] [117]
77Grzegorz Stachowiak [126] [140]
78Rob van Stee [78] [81]
79Gopalakrishnan Sundaram [64]
80Tomasz Szymacha [23]
81Roberto Tamassia [43]
82Tomás Tichý [78] [81] [94] [96] [97] [108] [115] [120]
83Nodari Vakhania [77] [78] [81] [89]
84Gianluca Della Vedova [70]
85Sundar Vishwanathan [25] [29]
86Jeffery Westbrook [38] [47]
87Gerhard J. Woeginger [68] [71] [74] [79]
88Li Yan [138] [142]
89Jun Yang [111] [134]
90Neal E. Young [100] [101] [104] [109] [113] [118] [124] [129]
91Moti Yung (Mordechai M. Yung) [18] [20] [35]
92Youtao Zhang [111] [134]
93Xiuyi Zhou [134]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)