Dynamic problems in computational complexity theory are problems stated in terms of the changing input data. In the most general form a problem inâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2014

Highly Cited

2014

- Amir Abboud, Virginia Vassilevska Williams
- 2014 IEEE 55th Annual Symposium on Foundations ofâ€¦
- 2014

We consider several well-studied problems in dynamic algorithms and prove that sufficient progress on any of them would imply aâ€¦Â (More)

Is this relevant?

Highly Cited

2008

Highly Cited

2008

- Robert Junges, Ana L. C. Bazzan
- AAMAS
- 2008

Complete algorithms have been proposed to solve problems modelled as distributed constraint optimization (DCOP). However, thereâ€¦Â (More)

Is this relevant?

Highly Cited

2006

Highly Cited

2006

- Matteo Gagliolo, JÃ¼rgen Schmidhuber
- Annals of Mathematics and Artificial Intelligence
- 2006

Algorithm selection can be performed using a model of runtime distribution, learned during a preliminary training phase. There isâ€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- Shengxiang Yang, Xin Yao
- Soft Comput.
- 2005

Evolutionary algorithms have been widely used for stationary optimization problems. However, the environments of real worldâ€¦Â (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- Liam Roditty, Uri Zwick
- Algorithmica
- 2004

We obtain the following results related to dynamic versions of the shortest-paths problem: (i) Reductions that show that theâ€¦Â (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- Monika Henzinger, Valerie King
- J. ACM
- 1999

This paper solves a longstanding open problem in fully dynamic algorithms: We present the first fully dynamic algorithms thatâ€¦Â (More)

Is this relevant?

Highly Cited

1997

Highly Cited

1997

- Moses Charikar, Chandra Chekuri, TomÃ¡s Feder, Rajeev Motwani
- STOC
- 1997

Motivated by applications such as document and image classification in information retrieval, we consider the problem ofâ€¦Â (More)

Is this relevant?

Highly Cited

1997

Highly Cited

1997

- David Eppstein, Zvi Galil, Giuseppe F. Italiano, Amnon Nissenzweig
- J. ACM
- 1997

We provide data strutures that maintain a graph as edges are inserted and deleted, and keep track of the following propertiesâ€¦Â (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- G. Ramalingam, Thomas W. Reps
- Theor. Comput. Sci.
- 1996

hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh A common way to evaluate the timeâ€¦Â (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- Monika Henzinger, Valerie King
- STOC
- 1995

This paper solves a longstanding open problem in dynamic algorithms: We present the first dynamic algorithms that maintainâ€¦Â (More)

Is this relevant?