Expected-time Analysis
Expected-Time Analysis is a probabilistic method for evaluating the average-case performance of algorithms, particularly in the context of randomized data structures like skip lists, that characterizes the expected running time as a function of input size under typical probabilistic assumptions governing the structure’s randomization.
237
Publications
12.4K
Citations
447
Authors
251
Institutions
Publications per year
2017–2026
19
Parents
237
Universal classes of hash functions (Extended Abstract)
J. Lawrence Carter, Mark N. Wegman · 1977 · 349 citations · Full text
<i>K</i>-d trees for semidynamic point sets
Jon Bentley · 1990 · 345 citations · Full text
1–5 of 237
447
London School of Economics and Political Science, United Kingdom
9 publications · 571 citations
9
h-index
4
h-index
3
h-index
3
h-index
3
h-index
1–5 of 447
251
University of California, Berkeley
Berkeley, United States
10 h-index
12 publications
411 citations

Tel Aviv University
Tel Aviv, Israel
9 h-index
14 publications
571 citations
London School of Economics and Political Science
London, United Kingdom
9 h-index
9 publications
312 citations
Massachusetts Institute of Technology
Cambridge, United States
8 h-index
11 publications
459 citations
Carnegie Mellon University
Pittsburgh, United States
6 h-index
8 publications
264 citations
Stanford University
Stanford, United States
6 h-index
8 publications
1.3K citations
AT&T (United States)
Bedminster, United States
5 h-index
7 publications
943 citations

Weizmann Institute of Science
Rehovot, Israel
5 h-index
5 publications
597 citations
1–8 of 251
15 publications · 1.2K citations
14
h-index
9 publications · 269 citations
9
h-index
6 publications · 515 citations
6
h-index
JAP · 5 publications · 250 citations
5
h-index
JACM · 5 publications · 226 citations
5
h-index
1–5