Christoph Dürr
Christoph Dürr
CNRS, LIP6, Université Pierre et Marie Curie
Verified email at lip6.fr - Homepage
Title
Cited by
Cited by
Year
A quantum algorithm for finding the minimum
C Durr, P Hoyer
arXiv preprint quant-ph/9607014, 1996
3401996
Quantum query complexity of some graph problems
C Dürr, M Heiligman, P HOyer, M Mhalla
SIAM Journal on Computing 35 (6), 1310-1328, 2006
1712006
Reconstructing hv-convex polyominoes from orthogonal projections
C Durr, M Chrobak
arXiv preprint cs/9906021, 1999
1451999
Finding total unimodularity in optimization problems solved by linear programs
C Dürr, M Hurand
Algorithmica 59 (2), 256-268, 2011
112*2011
Quantum algorithms for element distinctness
H Buhrman, C Durr, M Heiligman, P Hoyer, F Magniez, M Santha, ...
Proceedings 16th Annual IEEE Conference on Computational Complexity, 131-137, 2001
1022001
Polynomial time algorithms for minimum energy scheduling
P Baptiste, M Chrobak, C Dürr
European Symposium on Algorithms, 136-150, 2007
81*2007
A decision procedure for unitary linear quantum cellular automata
C Durr, M Santha
Proceedings of 37th Conference on Foundations of Computer Science, 38-45, 1996
80*1996
Quantum algorithms for element distinctness
H Buhrman, C Dürr, M Heiligman, P Høyer, F Magniez, M Santha, ...
SIAM Journal on Computing 34 (6), 1324-1330, 2005
752005
Nash equilibria in Voronoi games on graphs
C Dürr, NK Thang
European Symposium on Algorithms, 17-28, 2007
742007
Reconstructing 3-colored grids from horizontal and vertical projections is NP-hard
C Dürr, F Guinez, M Matamala
European Symposium on Algorithms, 776-787, 2009
61*2009
Algorithms for temperature-aware task scheduling in microprocessor systems
M Chrobak, C Dürr, M Hurand, J Robert
International Conference on Algorithmic Applications in Management, 120-130, 2008
612008
Runway sequencing with holding patterns
K Artiouchine, P Baptiste, C Dürr
European Journal of Operational Research 189 (3), 1254-1266, 2008
592008
A note on scheduling equal-length jobs to maximize throughput
M Chrobak, C Durr, W Jawor, L Kowalik, M Kurowski
arXiv preprint cs/0410046, 2004
532004
Non-clairvoyant scheduling games
J Cohen, C Dürr, TN Kim
Theory of Computing Systems 49 (1), 3-23, 2011
512011
Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms
M Chrobak, C Dürr
Theoretical computer science 259 (1-2), 81-98, 2001
502001
The complexity of mean flow time scheduling problems with release times
P Baptiste, P Brucker, M Chrobak, C Dürr, SA Kravchenko, F Sourd
Journal of Scheduling 10 (2), 139-146, 2007
352007
Reconstructing 3-colored grids from horizontal and vertical projections is NP-hard: a solution to the 2-atom problem in discrete tomography
C Dürr, F Guiñez, M Matamala
SIAM Journal on Discrete Mathematics 26 (1), 330-352, 2012
302012
Cellular automata and communication complexity
C Dürr, I Rapaport, G Theyssier
Theoretical Computer Science 322 (2), 355-368, 2004
292004
A decision procedure for unitary linear quantum cellular automata
C Dürr, M Santha
271996
Speed scaling with power down scheduling for agreeable deadlines
E Bampis, C Dürr, F Kacem, I Milis
Sustainable Computing: Informatics and Systems 2 (4), 184-189, 2012
252012
The system can't perform the operation now. Try again later.
Articles 1–20