My home page
Biography
Research
Publications
My group
Courses
Professional activities
FAQ
Personal
Papers

Daphne Koller Publications
Research Areas (all)Publication TypeYears
CGTComputational Game Theory   TCSTheoretical Computer Science
JJournal Article
CConference Paper
BBook
ChBook Chapter
TTechnical Report
PhDPhD Disseration
1985 - 1989
1990 - 1994
1995 - 1999
2000 - 2004
2005 - 2009
2010 - 2014

TypeReferenceDownload
topics: CGTTCS

1997
J   D.R. Karger and D. Koller (1997). "(De)randomized construction of small sample spaces in NC." Journal of Computer and System Sciences, 55(3), 402-413. Full version of paper from FOCS '94. [older version, 1994]bib/abs pdf ps.gz
topics:    TCS

J   B. von Stengel and D. Koller (1997). "Team-maxmin equilibria." Games and Economic Behavior, 21, 309-321. bib/abs pdf
topics: CGT TCS

1996
J   D. Koller, N. Megiddo, and B. von Stengel (1996). "Efficient Computation of Equilibria for Extensive Two-Person Games." Games and Economic Behavior, 14(2). bib/abs pdf ps.gz
topics: CGT TCS

1995
C   D. Koller and A. Pfeffer (1995). "Generating and solving imperfect information games." Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI) (pp. 1185-1192). bib/abs pdf ps.gz
topics: CGT TCS

C   J. Feigenbaum, D. Koller, and P. Shor (1995). "A game-theoretic classification of interactive complexity classes." Proceedings of the 10th Annual IEEE Conference on Structure in Complexity Theory (STRUCTURES) (pp. 227-237). bib/abs pdf ps.gz
topics:    TCS

1994
J   D. Koller and N. Megiddo (1994). "Constructing Small Sample Spaces Satisfying Given Constraints." Siam Journal on Discrete Mathematics, 7(2), 260-274. Full version of paper in STOC '93. bib/abs pdf ps.gz
topics:    TCS

C   D. Koller, N. Megiddo, and B. von Stengel (1994). "Fast Algorithms for Finding Randomized Strategies in Game Trees." Proceedings of the 26th ACM Symposium on Theory of Computing (STOC '94) (pp. 750-759). bib/abs pdf ps.gz
topics: CGT TCS

C   D.R. Karger and D. Koller (1994). "(De)randomized construction of small sample spaces in NC." Proceedings of the 35nd Annual Symposium on the Foundations of Computer Science (FOCS) (pp. 252-263). [newer version, 1997]bib/abs pdf ps.gz
topics:    TCS

1993
J   D.R. Karger, D. Koller, and S. J. Phillips (1993). "Finding the hidden path: time bounds for all-pairs shortest paths." SIAM Journal on Computing, 22(6), 1199-1217. Full version of paper in FOCS '91. bib/abs pdf ps.gz
topics:    TCS

1992
J   D. Koller and N. Megiddo (1992). "The complexity of two-person zero-sum games in extensive form." Games and Economic Bahavior, 4(4), 528-552. bib/abs pdf
topics: CGT TCS

1991
J   A. Bar-Noy, D. Dolev, D. Koller, and D. Peleg (1991). "Fault-tolerant critical section management in asynchronous environments." Information and Computation, 91(1), 1-20. Full version of paper in WDAG '89. bib
topics:    TCS

1987
C   H. Attiya, A. Bar-Noy, D. Dolev, D. Koller, D. Peleg, and R. Reischuk (1987). "Achievable cases in an asynchronous environment." Proceedings of the 28th Annual Symposium on the Foundations of Computer Science (FOCS) (pp. 337-346). bib
topics:    TCS

Click to go to robotics Click to go to theory Click to go to CS Stanford Click to go to Stanford's Webpage
home | biography | research | papers | my group
courses | professional activities | FAQ | personal