en
de
Local
OpenID
:
no help available
no help available
BibSonomy
author
tag
user
group
author
concept
BibTeX key
search:all
::
Christos Papadimitriou
::
The blue social bookmark and publication sharing system.
sign in
home
groups
popular
posts
tags
authors
concepts
discussions
actions for all displayed bookmarks:
export:
RSS
,
BibTeX
,
XML
sort:
criterion:
date
,
title
order:
ascending
,
descending
others:
bookmarks per page:
5
10
20
50
100
bookmarks
actions for all displayed publications:
export:
RSS
,
BibTeX
,
RDF
,
more...
sort:
criterion:
date
,
title
order:
ascending
,
descending
advanced...
others:
publications per page:
5
10
20
50
100
publications
(440)
tags
dblp
imported
complexity
market
todo_tags
graphs
mgr
book
nn
Computation_Theory
XMLTage2006-2
lsa
fisher
primal-dual
math
graph
shortest-paths
lsi
linear_programming
2000
independent
traffic-lights
cites.ref
dirichlet
2008
probabilistic
myown
eigenvalues
time
information-value
theory
spectral_graph_theory
sets
distributed-decision-making
books
algorithms
optimization
divers.lang,
divers.NPC
listing
databases
SS10_HPI
web-graph
state.unclassified
power-law
LSI
computer
computational
science
nlp
No matching items.
... The Interaction Between Algorithms and Game Theory.
Christos H. Papadimitriou
.
WEA,
volume 3503 of Lecture Notes in Computer Science,
page 1-3.
Springer,
(
2005
)
Christos H. Papadimitriou
.
WEA,
volume 3503 of Lecture Notes in Computer Science,
page 1-3.
Springer,
(
2005
)
8 years ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
Networks and Games.
Christos H. Papadimitriou
.
HiPC,
volume 3296 of Lecture Notes in Computer Science,
page 7.
Springer,
(
2004
)
Christos H. Papadimitriou
.
HiPC,
volume 3296 of Lecture Notes in Computer Science,
page 7.
Springer,
(
2004
)
8 years ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
Adaptive, unsupervised stream mining.
Spiros Papadimitriou
,
Anthony Brockwell
, and
Christos Faloutsos
.
VLDB J.
13(3):222-239
(
2004
)
Spiros Papadimitriou
,
Anthony Brockwell
, and
Christos Faloutsos
.
VLDB J.
13(3):222-239
(
2004
)
8 years ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
The New Problems.
Christos H. Papadimitriou
.
PCK50,
page 10.
ACM,
(
2003
)
Christos H. Papadimitriou
.
PCK50,
page 10.
ACM,
(
2003
)
9 years ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
The Complexity of the Travelling Repairman Problem.
Foto N. Afrati
,
Stavros S. Cosmadakis
,
Christos H. Papadimitriou
,
George Papageorgiou
, and
Nadia Papakostantinou
.
ITA
20(1):79-87
(
1986
)
Foto N. Afrati
,
Stavros S. Cosmadakis
,
Christos H. Papadimitriou
,
George Papageorgiou
, and
Nadia Papakostantinou
.
ITA
20(1):79-87
(
1986
)
9 years ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
Adaptive, Hands-Off Stream Mining.
Spiros Papadimitriou
,
Anthony Brockwell
, and
Christos Faloutsos
.
VLDB,
page 560-571.
(
2003
)
Spiros Papadimitriou
,
Anthony Brockwell
, and
Christos Faloutsos
.
VLDB,
page 560-571.
(
2003
)
9 years ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
Algorithmic problems related to the Internet.
Christos H. Papadimitriou
.
HERCMA,
page 92.
LEA Press, Athens, Hellas,
(
2001
)
Christos H. Papadimitriou
.
HERCMA,
page 92.
LEA Press, Athens, Hellas,
(
2001
)
9 years ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
On the complexity of single-rule datalog queries.
Georg Gottlob
, and
Christos H. Papadimitriou
.
Inf. Comput.
183(1):104-122
(
2003
)
Georg Gottlob
, and
Christos H. Papadimitriou
.
Inf. Comput.
183(1):104-122
(
2003
)
9 years ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
The 2-Evader Problem.
Elias Koutsoupias
, and
Christos H. Papadimitriou
.
Inf. Process. Lett.
57(5):249-252
(
1996
)
Elias Koutsoupias
, and
Christos H. Papadimitriou
.
Inf. Process. Lett.
57(5):249-252
(
1996
)
9 years ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
Modularity of Cycles and Paths in Graphs.
Esther M. Arkin
,
Christos H. Papadimitriou
, and
Mihalis Yannakakis
.
J. ACM
38(2):255-274
(
1991
)
Esther M. Arkin
,
Christos H. Papadimitriou
, and
Mihalis Yannakakis
.
J. ACM
38(2):255-274
(
1991
)
9 years ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
Map graphs.
Zhi-Zhong Chen
,
Michelangelo Grigni
, and
Christos H. Papadimitriou
.
J. ACM
49(2):127-138
(
2002
)
Zhi-Zhong Chen
,
Michelangelo Grigni
, and
Christos H. Papadimitriou
.
J. ACM
49(2):127-138
(
2002
)
9 years ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
How to Learn an Unknown Environment I: The Rectilinear Case.
Xiaotie Deng
,
Tiko Kameda
, and
Christos H. Papadimitriou
.
J. ACM
45(2):215-245
(
1998
)
Xiaotie Deng
,
Tiko Kameda
, and
Christos H. Papadimitriou
.
J. ACM
45(2):215-245
(
1998
)
9 years ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
On a model of indexability and its bounds for range queries.
Joseph M. Hellerstein
,
Elias Koutsoupias
,
Daniel P. Miranker
,
Christos H. Papadimitriou
, and
Vasilis Samoladas
.
J. ACM
49(1):35-55
(
2002
)
Joseph M. Hellerstein
,
Elias Koutsoupias
,
Daniel P. Miranker
,
Christos H. Papadimitriou
, and
Vasilis Samoladas
.
J. ACM
49(1):35-55
(
2002
)
9 years ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
Some Computational Aspects of Circumscription
Phokion G. Kolaitis
, and
Christos H. Papadimitriou
.
J. ACM
37(1):1-14
(
January 1990
)
Phokion G. Kolaitis
, and
Christos H. Papadimitriou
.
J. ACM
37(1):1-14
(
January 1990
)
9 years ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
On the k-Server Conjecture.
Elias Koutsoupias
, and
Christos H. Papadimitriou
.
J. ACM
42(5):971-983
(
1995
)
Elias Koutsoupias
, and
Christos H. Papadimitriou
.
J. ACM
42(5):971-983
(
1995
)
9 years ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
The complexity of searching a graph.
Nimrod Megiddo
,
S. Louis Hakimi
,
M. R. Garey
,
David S. Johnson
, and
Christos H. Papadimitriou
.
J. ACM
35(1):18-44
(
1988
)
Nimrod Megiddo
,
S. Louis Hakimi
,
M. R. Garey
,
David S. Johnson
, and
Christos H. Papadimitriou
.
J. ACM
35(1):18-44
(
1988
)
9 years ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
The Weighted Region Problem: Finding Shortest Paths Through a Weighted Planar Subdivision.
Joseph S. B. Mitchell
, and
Christos H. Papadimitriou
.
J. ACM
38(1):18-73
(
1991
)
Joseph S. B. Mitchell
, and
Christos H. Papadimitriou
.
J. ACM
38(1):18-73
(
1991
)
9 years ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
Flowshop scheduling with limited temporary storage.
Christos H. Papadimitriou
, and
Paris C. Kanellakis
.
J. ACM
27(3):533-549
(
1980
)
Christos H. Papadimitriou
, and
Paris C. Kanellakis
.
J. ACM
27(3):533-549
(
1980
)
9 years ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
The complexity of restricted spanning tree problems.
Christos H. Papadimitriou
, and
Mihalis Yannakakis
.
J. ACM
29(2):285-309
(
1982
)
Christos H. Papadimitriou
, and
Mihalis Yannakakis
.
J. ACM
29(2):285-309
(
1982
)
9 years ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
On the complexity of edge traversing.
Christos H. Papadimitriou
.
J. ACM
23(3):544-554
(
1976
)
Christos H. Papadimitriou
.
J. ACM
23(3):544-554
(
1976
)
9 years ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
BibSonomy is offered by the
KDE group
of the University of Kassel, the
DMIR group
of the University of Würzburg, and the
L3S Research Center
, Germany.
Privacy & Terms of Use
-
Contact