The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Christoph Dürr: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Harry Buhrman, Christoph Dürr, Mark Heiligman, Peter Høyer, Frédéric Magniez, Miklos Santha, Ronald de Wolf
    Quantum Algorithms for Element Distinctness. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2001, pp:131-137 [Conf]
  2. Christoph Dürr, Mathilde Hurand
    Finding Total Unimodularity in Optimization Problems Solved by Linear Programs. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:315-326 [Conf]
  3. Christoph Dürr, Miklos Santha
    A Decision Procedure for Unitary Linear Quantum Cellular Automata. [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:38-45 [Conf]
  4. Christoph Dürr, Mark Heiligman, Peter Høyer, Mehdi Mhalla
    Quantum Query Complexity of Some Graph Problems. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:481-493 [Conf]
  5. Wojciech Jawor, Marek Chrobak, Christoph Dürr
    Competitive Analysis of Scheduling Algorithms for Aggregated Links. [Citation Graph (0, 0)][DBLP]
    LATIN, 2006, pp:617-628 [Conf]
  6. Marek Chrobak, Christoph Dürr
    Reconstructing Polyatomic Structures from Discrete X-Rays: NP-Completeness Proof for Three Atoms. [Citation Graph (0, 0)][DBLP]
    MFCS, 1998, pp:185-193 [Conf]
  7. Christoph Dürr, Huong Lê Thanh, Miklos Santha
    A Decision Procedure for Well-Formed Linear Quantum Cellular Automata. [Citation Graph (0, 0)][DBLP]
    STACS, 1996, pp:281-292 [Conf]
  8. Marek Chrobak, Peter Couperus, Christoph Dürr, Gerhard J. Woeginger
    A Note on Tiling under Tomographic Constraints [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  9. Christoph Dürr, Ivan Rapaport, Guillaume Theyssier
    Cellular automata and communication complexity [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  10. Philippe Baptiste, Marek Chrobak, Christoph Dürr, Wojciech Jawor, Nodari Vakhania
    Preemptive Scheduling of Equal-Length Jobs to Maximize Weighted Throughput [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  11. Marek Chrobak, Christoph Dürr, Wojciech Jawor, Lukasz Kowalik, Maciej Kurowski
    A Note on Scheduling Equal-Length Jobs to Maximize Throughput [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  12. Christoph Dürr, Eric Goles Ch., Ivan Rapaport, Eric Rémila
    Tiling with bars under tomographic constraints [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  13. Christoph Dürr, Marek Chrobak
    Reconstructing Polyatomic Structures from Discrete X-Rays: NP-Completeness Proof for Three Atoms [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  14. Christoph Dürr, Marek Chrobak
    Reconstructing hv-Convex Polyominoes from Orthogonal Projections [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  15. Christoph Dürr, Huong LeThanh, Miklos Santha
    A decision procedure for well-formed linear quantum cellular automata [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  16. Christoph Dürr, Miklos Santha
    A decision procedure for unitary linear quantum cellular automata [Citation Graph (0, 0)][DBLP]
    CoRR, 1996, v:0, n:, pp:- [Journal]
  17. Christoph Dürr, Peter Høyer
    A Quantum Algorithm for Finding the Minimum [Citation Graph (0, 0)][DBLP]
    CoRR, 1996, v:0, n:, pp:- [Journal]
  18. Marek Chrobak, Christoph Dürr
    Reconstructing hv-Convex Polyominoes from Orthogonal Projections. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:69, n:6, pp:283-289 [Journal]
  19. Philippe Baptiste, Marek Chrobak, Christoph Dürr, Wojciech Jawor, Nodari Vakhania
    Preemptive scheduling of equal-length jobs to maximize weighted throughput. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2004, v:32, n:3, pp:258-264 [Journal]
  20. Christoph Dürr, Huong LeThanh, Miklos Santha
    A decision procedure for well-formed linear quantum cellular automata. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1997, v:11, n:4, pp:381-394 [Journal]
  21. Marek Chrobak, Christoph Dürr, Wojciech Jawor, Lukasz Kowalik, Maciej Kurowski
    A Note on Scheduling Equal-Length Jobs to Maximize Throughput. [Citation Graph (0, 0)][DBLP]
    J. Scheduling, 2006, v:9, n:1, pp:71-73 [Journal]
  22. 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. [Citation Graph (0, 0)][DBLP]
    J. Scheduling, 2007, v:10, n:2, pp:139-146 [Journal]
  23. Harry Buhrman, Christoph Dürr, Mark Heiligman, Peter Høyer, Frédéric Magniez, Miklos Santha, Ronald de Wolf
    Quantum Algorithms for Element Distinctness. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:34, n:6, pp:1324-1330 [Journal]
  24. Christoph Dürr, Mark Heiligman, Peter Høyer, Mehdi Mhalla
    Quantum Query Complexity of Some Graph Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:35, n:6, pp:1310-1328 [Journal]
  25. Christoph Dürr, Miklos Santha
    A Decision Procedure for Unitary Linear Quantum Cellular Automata. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:4, pp:1076-1089 [Journal]
  26. Marek Chrobak, Peter Couperus, Christoph Dürr, Gerhard J. Woeginger
    On tiling under tomographic constraints. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:2125-2136 [Journal]
  27. Marek Chrobak, Christoph Dürr
    Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:259, n:1-2, pp:81-98 [Journal]
  28. Christoph Dürr, Eric Goles Ch., Ivan Rapaport, Eric Rémila
    Tiling with bars under tomographic constraints. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:1317-1329 [Journal]
  29. Christoph Dürr, Ivan Rapaport, Guillaume Theyssier
    Cellular automata and communication complexity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:322, n:2, pp:355-368 [Journal]
  30. Philippe Baptiste, Marek Chrobak, Christoph Dürr
    Polynomial Time Algorithms for Minimum Energy Scheduling. [Citation Graph (0, 0)][DBLP]
    ESA, 2007, pp:136-150 [Conf]
  31. Christoph Dürr, Nguyen Kim Thang
    Nash Equilibria in Voronoi Games on Graphs. [Citation Graph (0, 0)][DBLP]
    ESA, 2007, pp:17-28 [Conf]
  32. Christoph Dürr, Nguyen Kim Thang
    Nash equilibria in Voronoi games on graphs [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  33. Christoph Dürr, Mathilde Hurand
    Finding total unimodularity in optimization problems solved by linear programs [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  34. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  35. Philippe Baptiste, Marek Chrobak, Christoph Dürr, Francis Sourd
    Preemptive Multi-Machine Scheduling of Equal-Length Jobs to Minimize the Average Flow Time [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]

  36. Algorithms for Temperature-Aware Task Scheduling in Microprocessor Systems. [Citation Graph (, )][DBLP]


  37. Tile-Packing Tomography Is \mathbbNP{\mathbb{NP}}-hard. [Citation Graph (, )][DBLP]


  38. Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard. [Citation Graph (, )][DBLP]


  39. Collecting weighted items from a dynamic queue. [Citation Graph (, )][DBLP]


  40. Online Scheduling of Bounded Length Jobs to Maximize Throughput. [Citation Graph (, )][DBLP]


  41. Non-clairvoyant Scheduling Games. [Citation Graph (, )][DBLP]


  42. Competitive Analysis of Scheduling Algorithms for Aggregated Links. [Citation Graph (, )][DBLP]


  43. Algorithms for Temperature-Aware Task Scheduling in Microprocessor Systems [Citation Graph (, )][DBLP]


  44. Generalized Whac-a-Mole [Citation Graph (, )][DBLP]


  45. Online Scheduling of Bounded Length Jobs to Maximize Throughput [Citation Graph (, )][DBLP]


  46. Reconstructing 3-colored grids from horizontal and vertical projections is NP-hard [Citation Graph (, )][DBLP]


  47. Polynomial Time Algorithms for Minimum Energy Scheduling [Citation Graph (, )][DBLP]


  48. Tile Packing Tomography is NP-hard [Citation Graph (, )][DBLP]


Search in 0.032secs, Finished in 0.033secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002