Demo Data from SIGIR 2026 / reviewers in the wild / expert
Kireeti Kompella
dblp:69/2727
· DBLP profile ↗
4ranked-venue papers
1as first author
0since 2021 · last 1995
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 2 · 1 first-authorTheory of computation · 2
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
2 papers |
Algorithms and data structures · 37% Computational complexity · 37% Mathematical optimization · 27% | |
| Network and information security
2 papers |
Cryptographic protocols and secure computation · 67% Cryptographic primitives and cryptanalysis · 33% |
Topics — the 6 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Mathematical optimization
integer programming |
0.0 | 1 | 1995 | Efficient Checkers for Number-Theoretic Computations · Inf. Comput. 1995 |
Algorithms and data structures
number-theoretic algorithms |
0.0 | 1 | 1995 | Efficient Checkers for Number-Theoretic Computations · Inf. Comput. 1995 |
Computational complexity › verification complexity
program checking |
0.0 | 1 | 1995 | Efficient Checkers for Number-Theoretic Computations · Inf. Comput. 1995 |
Cryptographic protocols and secure computation
verifiable computation |
0.0 | 1 | 1990 | Fast Checkers for Cryptography · CRYPTO 1990 |
Algorithms and data structures
parallel algorithms |
0.0 | 1 | 1988 | Using Smoothness to Achieve Parallelism (Abstract) · STOC 1988 |
Cryptographic primitives and cryptanalysis › public-key cryptography
signature scheme cryptanalysis |
0.0 | 1 | 1985 | Breaking the Ong-Schnorr-Shamir Signature Scheme for Quadratic Number Fields · CRYPTO 1985 |
Methods — techniques the papers use, named apart from their topics
randomized checking · 0.0smoothness · 0.0algebraic techniques · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1995 | Efficient Checkers for Number-Theoretic Computations
Leonard M. Adleman, Ming-Deh A. Huang, Kireeti Kompella |
Inf. Comput. | 3 |
| 1990 | Fast Checkers for Cryptography
Kireeti Kompella, Leonard M. Adleman |
CRYPTO | 1 |
| 1988 | Using Smoothness to Achieve Parallelism (Abstract)abstractArticle Free Access Share on Using smoothness to achieve parallelism Authors: Leonard Adleman Department of Computer Science, University of Southern California Department of Computer Science, University of Southern CaliforniaView Profile , Kireeti Kompella Department of Computer Science, University of Southern California Department of Computer Science, University of Southern CaliforniaView Profile Authors Info & Claims STOC '88: Proceedings of the twentieth annual ACM symposium on Theory of computingJanuary 1988 Pages 528–538https://doi.org/10.1145/62212.62264Published:01 January 1988Publication History 12citation435DownloadsMetricsTotal Citations12Total Downloads435Last 12 Months32Last 6 weeks6 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF Leonard M. Adleman, Kireeti Kompella |
STOC | 2 |
| 1985 | Breaking the Ong-Schnorr-Shamir Signature Scheme for Quadratic Number Fields
Dennis Estes, Leonard M. Adleman, Kireeti Kompella, Kevin S. McCurley, Gary L. Miller |
CRYPTO | 3 |