Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Cohen, David"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An algebraic theory of complexity for discrete optimization
David A. Cohen
,
Martin C. Cooper
,
Páidí Creed
,
Peter G. Jeavons
,
Stanislav Z̑ivný
SIAM Journal on Computing
42
(5), 2013, pp. 1915-1939
An algebraic theory of complexity for valued constraints: Establishing a Galois connection
David A. Cohen
,
Páidí Creed
,
Peter G. Jeavons
,
Stanislav Z̑ivný
Lecture Notes in Computer Science
6907
, 2011, pp. 231-242
The expressive power of binary submodular functions
Stanislav Z̑ivný
,
David A. Cohen
,
Peter G. Jeavons
Lecture Notes in Computer Science
5734
, 2009, pp. 744-757
Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms
David A. Cohen
,
Martin C. Cooper
,
Peter G. Jeavons
Theoretical Computer Science
401
(1-3), 2008, pp. 36-51
A unified theory of structural tractability for constraint satisfaction problems
David Cohen
,
Peter Jeavons
,
Marc Gyssens
Journal of Computer and System Sciences
74
(5), 2008, pp. 721-743
The expressive power of valued constraints: Hierarchies and collapses
David A. Cohen
,
Peter G. Jeavons
,
Stanislav Z̑ivný
Theoretical Computer Science
409
(1), 2008, pp. 137-153
Identifying efficiently solvable cases of Max CSP
David Cohen
,
Martin Cooper
,
Peter Jeavons
,
Andrei Krokhin
Lecture Notes in Computer Science
2996
, 2004, pp. 152-163
Building tractable disjunctive constraints
David Cohen
,
Peter Jeavons
,
Peter Jonsson
,
Manolis Koubarakis??
Journal of the ACM
47
(5), 2000, pp. 826-853
Closure properties of constraints
Peter Jeavons
,
David Cohen
,
Marc Gyssens
Journal of the ACM
44
(4), 1997, pp. 527-548
Weighted binary trees for concurrent searching
David Cohen
,
Michael L. Fredman
Journal of Algorithms
20
(1), 1996, pp. 87-112
Products of finite state machines with full coverage
David M. Cohen
,
Michael L. Fredman
Theoretical Computer Science
154
(1), 1996, pp. 57-65
On the problem of sorting burnt pancakes
David S. Cohen
,
Manuel Blum
Discrete Applied Mathematics
61
, 1995, pp. 105-120
A unifying framework for tractable constraints
Peter Jeavons
,
David Cohen
,
Marc Gyssens
Lecture Notes in Computer Science
976
, 1995, pp. 276-291
An algebraic characterization of tractable constraints
Peter Jeavons
,
David Cohen
Lecture Notes in Computer Science
959
, 1995, pp. 633-642
Products of finite state machines with full coverage
David M. Cohen
,
Michael L. Fredman
Lecture Notes in Computer Science
700
, 1993, pp. 469-477