| Year | Rank | Type | Title / Venue / Authors |
|---|---|---|---|
| 2024 | J | jnl |
Frontiers Comput. Sci.
|
| 2024 | J | jnl |
CoRR
|
| 2024 | J | jnl |
ACM Trans. Quantum Comput.
|
| 2023 | J | jnl |
ACM Trans. Quantum Comput.
|
| 2023 | J | jnl |
CoRR
|
| 2022 | J | jnl |
CoRR
|
| 2022 | Misc | conf |
SEC
|
| 2020 | J | jnl |
Theor. Comput. Sci.
|
| 2019 | J | jnl |
Computer
|
| 2017 | — | conf |
QTOP@NetSys
|
| 2016 | — | ch. |
Encyclopedia of Algorithms
|
| 2016 | J | jnl |
ACM J. Exp. Algorithmics
|
| 2014 | A | ed. |
ALENEX
|
| 2014 | — | book |
Adiabatic Quantum Computation and Quantum Annealing
|
| 2014 | J | jnl |
CoRR
|
| 2013 | — | conf |
Conf. Computing Frontiers
|
| 2012 | — | book |
|
| 2010 | J | jnl |
ACM J. Exp. Algorithmics
|
| 2009 | J | jnl |
J. Comput. Sci. Coll.
|
| 2008 | — | ed. |
WEA
|
| 2008 | — | ch. |
Encyclopedia of Algorithms
|
| 2007 | J | jnl |
Commun. ACM
|
| 2007 | — | conf |
Experimental Computer Science
|
| 2002 | — | ed. |
Data Structures, Near Neighbor Searches, and Methodology
|
| 2000 | — | conf |
Experimental Algorithmics
|
| 1999 | — | conf |
Data Structures, Near Neighbor Searches, and Methodology
|
| 1999 | A | ed. |
ALENEX
|
| 1999 | J | jnl |
SIGACT News
|
| 1997 | J | jnl |
SIGACT News
|
| 1997 | A | conf |
AISTATS
|
| 1997 | B | conf |
IDA
|
| 1996 | J | jnl |
Math. Syst. Theory
|
| 1996 | J | jnl |
INFORMS J. Comput.
|
| 1996 | J | jnl |
INFORMS J. Comput.
|
| 1996 | J | jnl |
ACM Comput. Surv.
|
| 1995 | J | jnl |
Algorithmica
|
| 1995 | J | jnl |
Random Struct. Algorithms
|
| 1993 | — | ed. |
Network Flows And Matching
|
| 1992 | J | jnl |
ACM Comput. Surv.
|
| 1991 | — | conf |
Network Flows And Matching
|
| 1991 | — | conf |
Network Flows And Matching
|
| 1985 | J | jnl |
Commun. ACM
|
| 1984 | A* | conf |
STOC
|