Spremljaj
Christoph Dürr
Christoph Dürr
CNRS, Sorbonne University, LIP6
Preverjeni e-poštni naslov na lip6.fr - Domača stran
Naslov
Navedeno
Navedeno
Leto
A quantum algorithm for finding the minimum
C Durr, P Hoyer
arXiv preprint quant-ph/9607014, 1996
5551996
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
2482006
Reconstructing hv-convex polyominoes from orthogonal projections
M Chrobak, C Dürr
Information Processing Letters 69 (6), 283-289, 1999
1541999
Finding total unimodularity in optimization problems solved by linear programs
C Dürr, M Hurand
Algorithmica 59 (2), 256-268, 2011
121*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
1072001
Polynomial time algorithms for minimum energy scheduling
P Baptiste, M Chrobak, C Dürr
European Symposium on Algorithms, 136-150, 2007
99*2007
Nash equilibria in Voronoi games on graphs
C Dürr, NK Thang
European Symposium on Algorithms, 17-28, 2007
992007
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
972005
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
84*1996
Runway sequencing with holding patterns
K Artiouchine, P Baptiste, C Dürr
European Journal of Operational Research 189 (3), 1254-1266, 2008
772008
Algorithms for temperature-aware task scheduling in microprocessor systems
M Chrobak, C Dürr, M Hurand, J Robert
Algorithmic Aspects in Information and Management: 4th International …, 2008
682008
Online computation with untrusted advice
S Angelopoulos, C Dürr, S Jin, S Kamali, M Renault
arXiv preprint arXiv:1905.05655, 2019
652019
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 Guinez, M Matamala
SIAM Journal on Discrete Mathematics 26 (1), 330-352, 2012
652012
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 Guinez, M Matamala
SIAM Journal on Discrete Mathematics 26 (1), 330-352, 2012
652012
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
612004
Non-clairvoyant scheduling games
J Cohen, C Dürr, T Nguyen Kim
Theory of Computing Systems 49, 3-23, 2011
542011
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
492001
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
382007
Cellular automata and communication complexity
C Dürr, I Rapaport, G Theyssier
Theoretical Computer Science 322 (2), 355-368, 2004
352004
Scheduling with explorable uncertainty
C Dürr, T Erlebach, N Megow, J Meißner
9th Innovations in Theoretical Computer Science Conference (ITCS 2018), 2018
322018
Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.
Članki 1–20