Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristoph Dürr
Person information
- affiliation: CNRS, Sorbonne University, Paris, France
- affiliation (former): École Polytechnique, Paris, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[i44]Christoph Dürr, Mathieu Mari, Ulrike Schmidt-Kraepelin:
On price-induced minmax matchings. CoRR abs/2302.11902 (2023)- 2021
- [j44]Christoph Dürr
, Shahin Kamali:
Randomized two-valued bounded delay online buffer management. Oper. Res. Lett. 49(2): 246-249 (2021) - [j43]Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukas Folwarczny, Lukasz Jez, Jirí Sgall, Kim Thang Nguyen, Pavel Veselý:
New results on multi-level aggregation. Theor. Comput. Sci. 861: 133-143 (2021) - [c32]Evripidis Bampis, Christoph Dürr, Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, Jens Schlöter:
Orienting (Hyper)graphs Under Explorable Stochastic Uncertainty. ESA 2021: 10:1-10:18 - [i43]Evripidis Bampis, Christoph Dürr, Thomas Erlebach, Murilo S. de Lima, Nicole Megow, Jens Schlöter:
Orienting (hyper)graphs under explorable stochastic uncertainty. CoRR abs/2107.00572 (2021) - [i42]Kim Thang Nguyen, Christoph Dürr:
Online Primal-Dual Algorithms with Predictions for Packing Problems. CoRR abs/2110.00391 (2021) - 2020
- [j42]Marek Chrobak, Christoph Dürr, Aleksander Fabijan, Bengt J. Nilsson:
Online Clique Clustering. Algorithmica 82(4): 938-965 (2020) - [j41]Christoph Dürr, Thomas Erlebach, Nicole Megow, Julie Meißner:
An Adversarial Model for Scheduling with Testing. Algorithmica 82(12): 3630-3675 (2020) - [j40]Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukas Folwarczny, Lukasz Jez, Jirí Sgall, Kim Thang Nguyen, Pavel Veselý:
Online Algorithms for Multilevel Aggregation. Oper. Res. 68(1): 214-232 (2020) - [j39]Spyros Angelopoulos, Christoph Dürr, Shendan Jin:
Online maximum matching with recourse. J. Comb. Optim. 40(4): 974-1007 (2020) - [c31]Christoph Dürr, Kim Thang Nguyen, Abhinav Srivastav, Léo Tible:
Non-monotone DR-submodular Maximization over General Convex Sets. IJCAI 2020: 2148-2154 - [c30]Spyros Angelopoulos, Christoph Dürr, Shendan Jin, Shahin Kamali, Marc P. Renault:
Online Computation with Untrusted Advice. ITCS 2020: 52:1-52:15 - [i41]Christoph Dürr, Shahin Kamali:
Randomized Two-Valued Bounded Delay Online Buffer Management. CoRR abs/2004.14715 (2020) - [i40]Fanny Dufossé, Christoph Dürr, Noël Nadal, Denis Trystram, Óscar C. Vásquez:
Scheduling with a processing time oracle. CoRR abs/2005.03394 (2020)
2010 – 2019
- 2019
- [j38]Spyros Angelopoulos, Christoph Dürr, Thomas Lidbetter:
The expanding search ratio of a graph. Discret. Appl. Math. 260: 51-65 (2019) - [c29]Spyros Angelopoulos, Christoph Dürr, Shendan Jin:
Best-Of-Two-Worlds Analysis of Online Search. STACS 2019: 7:1-7:17 - [i39]Spyros Angelopoulos, Christoph Dürr, Shendan Jin, Shahin Kamali, Marc P. Renault:
Online Computation with Untrusted Advice. CoRR abs/1905.05655 (2019) - [i38]Christoph Dürr, Kim Thang Nguyen, Abhinav Srivastav, Léo Tible:
Non-monotone DR-submodular Maximization: Approximation and Regret Guarantees. CoRR abs/1905.09595 (2019) - 2018
- [j37]Christoph Dürr, Heribert Vollmer:
Preface of STACS 2016 Special Issue. Theory Comput. Syst. 62(1): 1-3 (2018) - [j36]Spyros Angelopoulos, Christoph Dürr, Shahin Kamali, Marc P. Renault, Adi Rosén:
Online Bin Packing with Advice of Small Size. Theory Comput. Syst. 62(8): 2006-2034 (2018) - [j35]Christoph Dürr, Zdenek Hanzálek, Christian Konrad, Yasmina Seddik, René Sitters, Óscar C. Vásquez, Gerhard J. Woeginger:
The triangle scheduling problem. J. Sched. 21(3): 305-312 (2018) - [c28]Christoph Dürr, Thomas Erlebach, Nicole Megow, Julie Meißner:
Scheduling with Explorable Uncertainty. ITCS 2018: 30:1-30:14 - [c27]Spyros Angelopoulos, Christoph Dürr, Shendan Jin:
Online Maximum Matching with Recourse. MFCS 2018: 8:1-8:15 - [i37]Spyros Angelopoulos, Christoph Dürr, Shendan Jin:
Online Maximum Matching with Recourse. CoRR abs/1801.03462 (2018) - [i36]Christoph Dürr, Lukasz Jez, Óscar C. Vásquez:
Scheduling under dynamic speed-scaling for minimizing weighted completion time and energy consumption. CoRR abs/1805.11297 (2018) - [i35]Spyros Angelopoulos, Christoph Dürr, Shendan Jin:
Best-of-two-worlds analysis of online search. CoRR abs/1810.08109 (2018) - 2017
- [j34]Spyros Angelopoulos, Diogo Arsénio, Christoph Dürr, Alejandro López-Ortiz:
Multi-processor Search and Scheduling Problems with Setup Cost. Theory Comput. Syst. 60(4): 637-670 (2017) - [j33]Nikhil Bansal, Christoph Dürr, Kim Thang Nguyen, Óscar C. Vásquez:
The local-global conjecture for scheduling with non-linear cost. J. Sched. 20(3): 239-254 (2017) - [j32]Spyros Angelopoulos, Diogo Arsénio, Christoph Dürr:
Infinite linear programming and online searching with turn cost. Theor. Comput. Sci. 670: 11-22 (2017) - [j31]Christoph Dürr, Lukasz Jez, Óscar C. Vásquez:
Mechanism design for aggregating energy consumption and quality of service in speed scaling scheduling. Theor. Comput. Sci. 695: 28-41 (2017) - [i34]Christoph Dürr, Thomas Erlebach, Nicole Megow, Julie Meißner:
Scheduling with Explorable Uncertainty. CoRR abs/1709.02592 (2017) - 2016
- [c26]Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukas Folwarczny, Lukasz Jez, Jiri Sgall, Kim Thang Nguyen, Pavel Veselý:
Online Algorithms for Multi-Level Aggregation. ESA 2016: 12:1-12:17 - [c25]Christoph Dürr, Christian Konrad, Marc P. Renault:
On the Power of Advice and Randomization for Online Bipartite Matching. ESA 2016: 37:1-37:16 - [c24]Spyros Angelopoulos, Christoph Dürr, Thomas Lidbetter:
The Expanding Search Ratio of a Graph. STACS 2016: 9:1-9:14 - [i33]Christoph Dürr, Zdenek Hanzálek, Christian Konrad, René Sitters, Óscar C. Vásquez, Gerhard J. Woeginger:
The triangle scheduling problem. CoRR abs/1602.04365 (2016) - [i32]Spyros Angelopoulos, Christoph Dürr, Thomas Lidbetter:
The expanding search ratio of a graph. CoRR abs/1602.06258 (2016) - [i31]Christoph Dürr, Christian Konrad, Marc P. Renault:
On the Power of Advice and Randomization for Online Bipartite Matching. CoRR abs/1602.07154 (2016) - 2015
- [j30]Christoph Dürr, Lukasz Jez, Oscar C. Vásquez:
Scheduling under dynamic speed-scaling for minimizing weighted completion time and energy consumption. Discret. Appl. Math. 196: 20-27 (2015) - [j29]Odile Bellenguez-Morineau, Marek Chrobak, Christoph Dürr, Damien Prot:
A note on NP-hardness of preemptive mean flow-time scheduling for parallel machines. J. Sched. 18(3): 299-304 (2015) - [c23]Marek Chrobak, Christoph Dürr, Bengt J. Nilsson:
Competitive Strategies for Online Clique Clustering. CIAC 2015: 101-113 - [c22]Spyros Angelopoulos, Christoph Dürr, Shahin Kamali, Marc P. Renault, Adi Rosén:
Online Bin Packing with Advice of Small Size. WADS 2015: 40-53 - [i30]Christoph Dürr, Lukasz Jez, Óscar C. Vásquez:
Mechanism design for aggregating energy consumption and quality of service in speed scaling scheduling. CoRR abs/1504.03586 (2015) - [i29]Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukas Folwarczny, Lukasz Jez, Jirí Sgall, Kim Thang Nguyen, Pavel Veselý:
Online Algorithms for Multi-Level Aggregation. CoRR abs/1507.02378 (2015) - 2014
- [j28]Christoph Dürr, Thomas Wilke:
Preface of STACS 2012 Special Issue. Theory Comput. Syst. 55(4): 637-639 (2014) - [c21]Christoph Dürr, Óscar C. Vásquez:
Order constraints for single machine scheduling with non-linear cost. ALENEX 2014: 98-111 - [i28]Odile Bellenguez-Morineau, Marek Chrobak, Christoph Dürr, Damien Prot:
A Note on NP-Hardness of Preemptive Mean Flow-Time Scheduling for Parallel Machines. CoRR abs/1404.5424 (2014) - [i27]Marek Chrobak, Christoph Dürr, Bengt J. Nilsson:
Approximation Algorithms for Clique Clustering. CoRR abs/1411.4274 (2014) - 2013
- [j27]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) - [j26]Christoph Dürr, Flavio Guiñez:
The Wide Partition Conjecture and the Atom Problem in Discrete Tomography. Electron. Notes Discret. Math. 44: 351-356 (2013) - [j25]Christoph Dürr, Thomas Schwentick:
Preface of Special Issue on Theoretical Aspects of Computer Science. Theory Comput. Syst. 53(2): 123-125 (2013) - [j24]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) - [c20]Christoph Dürr, Lukasz Jez, Óscar C. Vásquez:
Mechanism Design for Aggregating Energy Consumption and Quality of Service in Speed Scaling Scheduling. WINE 2013: 134-145 - [i26]Christoph Dürr, Óscar C. Vásquez:
Order constraints for single machine scheduling with non-linear cost. CoRR abs/1304.6188 (2013) - 2012
- [j23]Marek Chrobak, Christoph Dürr, Flavio Guiñez, Antoni Lozano, Kim Thang Nguyen:
Tile-Packing Tomography Is NP-hard. Algorithmica 64(2): 267-278 (2012) - [j22]Christoph Dürr, Maurice Queyranne, Frits C. R. Spieksma, Fabrice Talla Nobibon, Gerhard J. Woeginger:
The interval ordering problem. Discret. Appl. Math. 160(7-8): 1094-1103 (2012) - [j21]Christoph Dürr, Lukasz Jez, Kim Thang Nguyen:
Online scheduling of bounded length jobs to maximize throughput. J. Sched. 15(5): 653-664 (2012) - [j20]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. Discret. Math. 26(1): 330-352 (2012) - [j19]Evripidis Bampis, Christoph Dürr, Fadi Kacem, Ioannis Milis:
Speed scaling with power down scheduling for agreeable deadlines. Sustain. Comput. Informatics Syst. 2(4): 184-189 (2012) - [j18]Philippe Baptiste, Marek Chrobak, Christoph Dürr:
Polynomial-time algorithms for minimum energy scheduling. ACM Trans. Algorithms 8(3): 26:1-26:29 (2012) - [c19]Christoph Dürr, Thomas Wilke:
Frontmatter, Foreword, Conference Organization, External Reviewers, Table of Contents. STACS 2012 - [c18]Christoph Dürr, Ioannis Milis, Julien Robert, Georgios Zois:
Approximating the Throughput by Coolest First Scheduling. WAOA 2012: 187-200 - [c17]Johanne Cohen, Christoph Dürr, Kim Thang Nguyen:
Smooth Inequalities and Equilibrium Inefficiency in Scheduling Games. WINE 2012: 350-363 - [e2]Christoph Dürr, Thomas Wilke:
29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France. LIPIcs 14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2012, ISBN 978-3-939897-35-4 [contents] - [i25]Johanne Cohen, Christoph Dürr, Kim Thang Nguyen:
Smooth Inequalities and Equilibrium Inefficiency in Scheduling Games. CoRR abs/1202.4302 (2012) - 2011
- [j17]Christoph Dürr, Mathilde Hurand:
Finding Total Unimodularity in Optimization Problems Solved by Linear Programs. Algorithmica 59(2): 256-268 (2011) - [j16]Johanne Cohen, Christoph Dürr, Kim Thang Nguyen:
Non-clairvoyant Scheduling Games. Theory Comput. Syst. 49(1): 3-23 (2011) - [j15]Marek Chrobak, Christoph Dürr, Mathilde Hurand, Julien Robert:
Algorithms for temperature-aware task scheduling in microprocessor systems. Sustain. Comput. Informatics Syst. 1(3): 241-247 (2011) - [c16]Thomas Schwentick, Christoph Dürr:
Frontmatter, Table of Contents, Preface, Conference Organization. STACS 2011 - [e1]Thomas Schwentick, Christoph Dürr:
28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany. LIPIcs 9, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2011, ISBN 978-3-939897-25-5 [contents] - [i24]Johanne Cohen, Christoph Dürr, Kim Thang Nguyen:
Non-clairvoyant Scheduling Games. CoRR abs/1101.1256 (2011) - [i23]Evripidis Bampis, Christoph Dürr, Fadi Kacem, Ioannis Milis:
Speed scaling with power down scheduling for agreeable deadlines. CoRR abs/1111.3398 (2011) - [i22]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, Kim Thang Nguyen:
Tile-Packing Tomography Is \mathbbNP{\mathbb{NP}}-hard. COCOON 2010: 254-263 - [i21]Marek Chrobak, Philippe Baptiste, Christoph Dürr:
Polynomial Time Algorithms for Minimum Energy Scheduling. Scheduling 2010
2000 – 2009
- 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]Christoph Dürr, Kim Thang Nguyen:
Non-clairvoyant Scheduling Games. SAGT 2009: 135-146 - [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, Kim Thang Nguyen:
Online Scheduling of Bounded Length Jobs to Maximize Throughput. WAOA 2009: 116-127 - [i20]Christoph Dürr, Lukasz Jez, Kim Thang Nguyen:
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, Kim Thang Nguyen:
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. Eur. J. Oper. Res. 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. Sched. 10(2): 139-146 (2007) - [c9]Christoph Dürr, Kim Thang Nguyen:
Nash Equilibria in Voronoi Games on Graphs. ESA 2007: 17-28 - [c8]Philippe Baptiste, Marek Chrobak, Christoph Dürr:
Polynomial Time Algorithms for Minimum Energy Scheduling. ESA 2007: 136-150 - [i14]Christoph Dürr, Kim Thang Nguyen:
Nash equilibria in Voronoi games on graphs. CoRR abs/cs/0702054 (2007) - 2006
- [b1]Christoph Dürr:
Tomographie discrète, calcul quantique et ordonnancement. (Discrete tomography, quantum computation and scheduling). University of Paris-Sud, Orsay, France, 2006 - [j11]Marek Chrobak, Christoph Dürr, Wojciech Jawor, Lukasz Kowalik, Maciej Kurowski:
A Note on Scheduling Equal-Length Jobs to Maximize Throughput. J. Sched. 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. CCC 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)
1990 – 1999
- 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)
Coauthor Index