| 2013 | ||
|---|---|---|
| j23 | Marcin Bienkowski, Marek Chrobak, Christoph Dürr, Mathilde Hurand, Artur Jez, Lukasz Jez, Grzegorz Stachowiak: Collecting Weighted Items from a Dynamic Queue. Algorithmica 65(1): 60-94 (2013) | |
| j22 | Marcin Bienkowski, Marek Chrobak, Christoph Dürr, Mathilde Hurand, Artur Jez, Lukasz Jez, Grzegorz Stachowiak: A ϕ-competitive algorithm for collecting items with increasing weights from a dynamic queue. Theor. Comput. Sci. 475: 92-102 (2013) | |
| i25 | Christoph Dürr, Oscar C. Vásquez: Order constraints for single machine scheduling with non-linear cost. CoRR abs/1304.6188 (2013) | |
| 2012 | ||
| j21 | Marek Chrobak, Christoph Dürr, Flavio Guiñez, Antoni Lozano, Nguyen Kim Thang: Tile-Packing Tomography Is NP-hard. Algorithmica 64(2): 267-278 (2012) | |
| j20 | Christoph Dürr, Maurice Queyranne, Frits C. R. Spieksma, Fabrice Talla Nobibon, Gerhard J. Woeginger: The interval ordering problem. Discrete Applied Mathematics 160(7-8): 1094-1103 (2012) | |
| j19 | Christoph Dürr, Lukasz Jez, Nguyen Kim Thang: Online scheduling of bounded length jobs to maximize throughput. J. Scheduling 15(5): 653-664 (2012) | |
| j18 | Christoph Dürr, Flavio Guiñez, Martín Matamala: Reconstructing 3-Colored Grids from Horizontal and Vertical Projections is NP-Hard: A Solution to the 2-Atom Problem in Discrete Tomography. SIAM J. Discrete Math. 26(1): 330-352 (2012) | |
| j17 | Philippe Baptiste, Marek Chrobak, Christoph Dürr: Polynomial-time algorithms for minimum energy scheduling. ACM Transactions on Algorithms 8(3): 26 (2012) | |
| c18 | Christoph Dürr, Thomas Wilke: Frontmatter, Foreword, Conference Organization, External Reviewers, Table of Contents. STACS 2012 | |
| c17 | Johanne Cohen, Christoph Dürr, Nguyen Kim Thang: Smooth Inequalities and Equilibrium Inefficiency in Scheduling Games. WINE 2012: 350-363 | |
| e2 | Christoph Dürr, Thomas Wilke (Eds.): 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France. LIPIcs 14, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik 2012, isbn 978-3-939897-35-4 | |
| i24 | Johanne Cohen, Christoph Dürr, Nguyen Kim Thang: Smooth Inequalities and Equilibrium Inefficiency in Scheduling Games. CoRR abs/1202.4302 (2012) | |
| 2011 | ||
| j16 | Christoph Dürr, Mathilde Hurand: Finding Total Unimodularity in Optimization Problems Solved by Linear Programs. Algorithmica 59(2): 256-268 (2011) | |
| j15 | Johanne Cohen, Christoph Dürr, Nguyen Kim Thang: Non-clairvoyant Scheduling Games. Theory Comput. Syst. 49(1): 3-23 (2011) | |
| c16 | Thomas Schwentick, Christoph Dürr: Frontmatter, Table of Contents, Preface, Conference Organization. STACS 2011 | |
| e1 | Thomas Schwentick, Christoph Dürr (Eds.): 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany. LIPIcs 9, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik 2011, isbn 978-3-939897-25-5 | |
| i23 | Johanne Cohen, Christoph Dürr, Nguyen Kim Thang: Non-clairvoyant Scheduling Games. CoRR abs/1101.1256 (2011) | |
| i22 | Evripidis Bampis, Christoph Dürr, Fadi Kacem, Ioannis Milis: Speed scaling with power down scheduling for agreeable deadlines. CoRR abs/1111.3398 (2011) | |
| i21 | Christoph Dürr, Maurice Queyranne, Frits C. R. Spieksma, Fabrice Talla Nobibon, Gerhard J. Woeginger: The interval ordering problem. CoRR abs/1112.0534 (2011) | |
| 2010 | ||
| c15 | Marek Chrobak, Christoph Dürr, Flavio Guiñez, Antoni Lozano, Nguyen Kim Thang: Tile-Packing Tomography Is \mathbbNP{\mathbb{NP}}-hard. COCOON 2010: 254-263 | |
| 2009 | ||
| c14 | Christoph Dürr, Flavio Guiñez, Martín Matamala: Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard. ESA 2009: 776-787 | |
| c13 | ||
| c12 | Marcin 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 | |
| c11 | Christoph Dürr, Lukasz Jez, Nguyen Kim Thang: Online Scheduling of Bounded Length Jobs to Maximize Throughput. WAOA 2009: 116-127 | |
| i20 | Christoph Dürr, Lukasz Jez, Nguyen Kim Thang: Online Scheduling of Bounded Length Jobs to Maximize Throughput. CoRR abs/0902.2209 (2009) | |
| i19 | Christoph Dürr, Flavio Guiñez, Martín Matamala: Reconstructing 3-colored grids from horizontal and vertical projections is NP-hard. CoRR abs/0904.3169 (2009) | |
| i18 | Philippe Baptiste, Marek Chrobak, Christoph Dürr: Polynomial Time Algorithms for Minimum Energy Scheduling. CoRR abs/0908.3505 (2009) | |
| i17 | Marek Chrobak, Christoph Dürr, Flavio Guiñez, Antoni Lozano, Nguyen Kim Thang: Tile Packing Tomography is NP-hard. CoRR abs/0911.2567 (2009) | |
| 2008 | ||
| j14 | Wojciech Jawor, Marek Chrobak, Christoph Dürr: Competitive Analysis of Scheduling Algorithms for Aggregated Links. Algorithmica 51(4): 367-386 (2008) | |
| j13 | Konstantin Artiouchine, Philippe Baptiste, Christoph Dürr: Runway sequencing with holding patterns. European Journal of Operational Research 189(3): 1254-1266 (2008) | |
| c10 | Marek Chrobak, Christoph Dürr, Mathilde Hurand, Julien Robert: Algorithms for Temperature-Aware Task Scheduling in Microprocessor Systems. AAIM 2008: 120-130 | |
| i16 | Marek Chrobak, Christoph Dürr, Mathilde Hurand, Julien Robert: Algorithms for Temperature-Aware Task Scheduling in Microprocessor Systems. CoRR abs/0801.4238 (2008) | |
| i15 | 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 | ||
| j12 | 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) | |
| c9 | ||
| c8 | Philippe Baptiste, Marek Chrobak, Christoph Dürr: Polynomial Time Algorithms for Minimum Energy Scheduling. ESA 2007: 136-150 | |
| i14 | Christoph Dürr, Nguyen Kim Thang: Nash equilibria in Voronoi games on graphs. CoRR abs/cs/0702054 (2007) | |
| 2006 | ||
| j11 | 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) | |
| j10 | Christoph Dürr, Mark Heiligman, Peter Høyer, Mehdi Mhalla: Quantum Query Complexity of Some Graph Problems. SIAM J. Comput. 35(6): 1310-1328 (2006) | |
| c7 | Christoph Dürr, Mathilde Hurand: Finding Total Unimodularity in Optimization Problems Solved by Linear Programs. ESA 2006: 315-326 | |
| c6 | Wojciech Jawor, Marek Chrobak, Christoph Dürr: Competitive Analysis of Scheduling Algorithms for Aggregated Links. LATIN 2006: 617-628 | |
| i13 | Christoph Dürr, Mathilde Hurand: Finding total unimodularity in optimization problems solved by linear programs. CoRR abs/cs/0602016 (2006) | |
| i12 | 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) | |
| 2005 | ||
| j9 | Harry Buhrman, Christoph Dürr, Mark Heiligman, Peter Høyer, Frédéric Magniez, Miklos Santha, Ronald de Wolf: Quantum Algorithms for Element Distinctness. SIAM J. Comput. 34(6): 1324-1330 (2005) | |
| 2004 | ||
| j8 | 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) | |
| j7 | Christoph Dürr, Ivan Rapaport, Guillaume Theyssier: Cellular automata and communication complexity. Theor. Comput. Sci. 322(2): 355-368 (2004) | |
| c5 | Christoph Dürr, Mark Heiligman, Peter Høyer, Mehdi Mhalla: Quantum Query Complexity of Some Graph Problems. ICALP 2004: 481-493 | |
| i11 | 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) | |
| i10 | 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) | |
| 2003 | ||
| j6 | Christoph Dürr, Eric Goles Ch., Ivan Rapaport, Eric Rémila: Tiling with bars under tomographic constraints. Theor. Comput. Sci. 290(3): 1317-1329 (2003) | |
| j5 | Marek Chrobak, Peter Couperus, Christoph Dürr, Gerhard J. Woeginger: On tiling under tomographic constraints. Theor. Comput. Sci. 290(3): 2125-2136 (2003) | |
| 2002 | ||
| j4 | Christoph Dürr, Miklos Santha: A Decision Procedure for Unitary Linear Quantum Cellular Automata. SIAM J. Comput. 31(4): 1076-1089 (2002) | |
| i9 | Christoph Dürr, Ivan Rapaport, Guillaume Theyssier: Cellular automata and communication complexity. CoRR cs.CC/0210008 (2002) | |
| i8 | 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) | |
| 2001 | ||
| j3 | 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) | |
| c4 | Harry Buhrman, Christoph Dürr, Mark Heiligman, Peter Høyer, Frédéric Magniez, Miklos Santha, Ronald de Wolf: Quantum Algorithms for Element Distinctness. IEEE Conference on Computational Complexity 2001: 131-137 | |
| i7 | Marek Chrobak, Peter Couperus, Christoph Dürr, Gerhard J. Woeginger: A Note on Tiling under Tomographic Constraints. CoRR cs.CC/0108010 (2001) | |
| 1999 | ||
| j2 | Marek Chrobak, Christoph Dürr: Reconstructing hv-Convex Polyominoes from Orthogonal Projections. Inf. Process. Lett. 69(6): 283-289 (1999) | |
| i6 | Christoph Dürr, Eric Goles Ch., Ivan Rapaport, Eric Rémila: Tiling with bars under tomographic constraints. CoRR cs.DS/9903020 (1999) | |
| i5 | Christoph Dürr, Marek Chrobak: Reconstructing Polyatomic Structures from Discrete X-Rays: NP-Completeness Proof for Three Atoms. CoRR cs.DS/9906018 (1999) | |
| i4 | Christoph Dürr, Marek Chrobak: Reconstructing hv-Convex Polyominoes from Orthogonal Projections. CoRR cs.DS/9906021 (1999) | |
| i3 | Christoph Dürr, Huong Lê Thanh, Miklos Santha: A decision procedure for well-formed linear quantum cellular automata. CoRR cs.DS/9906024 (1999) | |
| 1998 | ||
| c3 | Marek Chrobak, Christoph Dürr: Reconstructing Polyatomic Structures from Discrete X-Rays: NP-Completeness Proof for Three Atoms. MFCS 1998: 185-193 | |
| 1997 | ||
| j1 | Christoph Dürr, Huong Lê Thanh, Miklos Santha: A decision procedure for well-formed linear quantum cellular automata. Random Struct. Algorithms 11(4): 381-394 (1997) | |
| 1996 | ||
| c2 | Christoph Dürr, Miklos Santha: A Decision Procedure for Unitary Linear Quantum Cellular Automata. FOCS 1996: 38-45 | |
| c1 | Christoph Dürr, Huong Lê Thanh, Miklos Santha: A Decision Procedure for Well-Formed Linear Quantum Cellular Automata. STACS 1996: 281-292 | |
| i2 | Christoph Dürr, Miklos Santha: A decision procedure for unitary linear quantum cellular automata. CoRR quant-ph/9604007 (1996) | |
| i1 | Christoph Dürr, Peter Høyer: A Quantum Algorithm for Finding the Minimum. CoRR quant-ph/9607014 (1996) | |
Data released under the ODC-BY 1.0 license — See also our legal information page