Sotabase

Career

· Doctor of Philosophy, Johns Hopkins University1998–2003
· Instructor in Computer Science, California Institute of Technology1984–2005
· Visiting Associate, California Institute of Technology1984–2005
· Former Postdoc, California Institute of Technology
· Technical Advisor, Google

Publications (15)

Singularity analysis, Hadamard products, and tree recurrences
2003
83
cited
Limiting distributions for additive functionals on Catalan trees
Theoretical Computer Science · 2003
46
cited
Synthesis of wiring signature-invariant equivalence class circuit mutants and applications to benchmarking
Proceedings Design, Automation and Test in Europe · 1998
45
cited
Transfer theorems and asymptotic distributional results for m‐ary search trees
Random Struct. Algorithms · 2003
31
cited
The space requirement of m-ary search trees: distributional asymptotics for m >= 27
2004
25
cited
Destruction of Very Simple Trees
Algorithmica · 2004
21
cited
Towards a new benchmarking paradigm in EDA: analysis of equivalence class mutant circuit distributions
ACM International Symposium on Physical Design · 1997
21
cited
Transfer theorems and asymptotic distributional results for m-ary search trees
2005
21
cited
Solvency Games
Electron. Colloquium Comput. Complex. · 2008
17
cited
Additive functionals on random search trees
2003
5
cited
A repertoire for additive functionals of uniformly distributed m-ary search trees (Extended Abstract)
2005
5
cited
Optimization of Placement Driven by the Cost of Wire Crossing.
1997
2
cited
Optimization of Placements Driven by the Cost of Wire Crossing Optimization of Placements Driven by the Cost of Wire Crossing
1997
1
cited
An Area{eecient Architecture for Performance{driven 4 4 2{d Dct Chip
1996
E XTENDED ABSTRACT : A repertoire for additive functionals of uniformly distributed mary search trees
2005
Sotabase
Nevin Kapur | Researcher Profile | Sotabase | Sotabase