FIND PROFESSORS AND RESEARCH OPPORTUNITIES

YourScholar.ai helps discover professors by research area, explore academic profiles, and find potential collaboration opportunities for Master's, PhD, and scholarship applications.

5403_sherstove-edited111-300x200.png

Alexander Sherstov

Computational Complexity Theory Computational Learning Theory Quantum Computing

Research Performance Summary

52
Total Papers
2288
Total Citations
27
H-Index
2002-2024
Active Research Span

First Recorded Paper

Using Java to design and test hardware circuits over a classroom network

Year: 2002

Citations: 3

Venue: Proceedings of the 33rd SIGCSE technical symposium on Computer science

Latest Recorded Paper

The communication complexity of approximating matrix rank

Year: 2024

Citations: 3

Venue: 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS

Last 10 Years Publication Activity

This timeline shows the professor's yearly publication activity.

2024
1
2022
2
2021
2
2020
2
2019
3
2018
5
2016
1
2014
3
2013
2
2012
3
2011
2

Publication Venues and Collaboration

Journal, Conference, and Book Publication Breakdown

Conference 19
Journal 10
Book 1

Top Coauthors

Sherstov Stone Klivans

Research Impact by Period

2020-2024

Period Stats
Papers 7
Citations 65
Avg. Citations / Paper 9.3
H-Index 4

2015-2019

Period Stats
Papers 9
Citations 164
Avg. Citations / Paper 18.2
H-Index 7

2010-2014

Period Stats
Papers 15
Citations 1031
Avg. Citations / Paper 68.7
H-Index 15

2005-2009

Period Stats
Papers 16
Citations 910
Avg. Citations / Paper 56.9
H-Index 11

2000-2004

Period Stats
Papers 5
Citations 118
Avg. Citations / Paper 23.6
H-Index 3

Contact and Professional Links

Contact Information

sherstov@cs.ucla.edu
3102670866

Professional Links

Google Scholar
University Page

Detected Research Keywords

Learning Intersections Halfspaces Communication Query Complexity Automated Stock Trading Intersection Two Halfspaces Multiparty Communication Complexity Communication Lower Bounds Lower Bounds Learning Bounds Learning Intersections Constant Depth Circuits