Skip to search formSkip to main contentSkip to account menu

Steven Rudich

Known as: Rudich 
Steven Rudich (born October 4, 1961) is a professor in the Carnegie Mellon School of Computer Science. In 1994, he and Alexander Razborov proved that… 
Wikipedia (opens in a new tab)

Related topics

Related topics

6 relations
Computational complexity theoryDTIMEGödel PrizeJournal of Cryptology

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Generalized matrix completion and algebraic natural proofs
Algebraic natural proofs were recently introduced by Forbes, Shpilka and Volk (Proc. of the 49th Annual ACM SIGACT Symposium on… 
2016
2016
In vitro exposure to isoprene-derived secondary organic aerosol by direct deposition and its effects on COX-2 and IL-8 gene expression
Abstract. Atmospheric oxidation of isoprene, the most abundant non-methane hydrocarbon emitted into Earth's atmosphere primarily… 
Highly Cited
2016
Highly Cited
2016
Watermarking cryptographic capabilities
A watermarking scheme for programs embeds some information called a mark into a program while preserving its functionality. No… 
2015
2015
Publicly Verifiable Software Watermarking
Software Watermarking is the process of transforming a program into a functionally equivalent “marked” program in such a way that… 
Highly Cited
2010
Highly Cited
2010
Who is James Bond? : the Dark Triad as an agentic social style
If the Dark Triad are costly traits for individuals to have and individuals are predisposed to avoid interacting with selfish… 
Highly Cited
2008
Highly Cited
2008
Merkle Puzzles are Optimal
We prove that every key exchange protocol in the random oracle model in which the honest users make at most n queries to the… 
2008
2008
A Practical Approach to Partiality - A Proof Based Approach
Partial functions are frequently used when specifying and reasoning about computer programs. Using partial functions entails… 
2003
2003
Computing Elementary Symmetric Polynomials with a Subpolynomial Number of Multiplications
  • V. Grolmusz
  • SIAM journal on computing (Print)
  • 2003
  • Corpus ID: 14639768
Elementary symmetric polynomials $S_n^k$ are the building blocks of symmetric polynomials. In this work we prove that for… 
Highly Cited
2000
Highly Cited
2000
The relationship between public key encryption and oblivious transfer
In this paper we study the relationships among some of the most fundamental primitives and protocols in cryptography: public-key… 
2000
2000
A dual version of Reimer's inequality and a proof of Rudich's conjecture
We prove a dual version of the celebrated inequality of D. Reimer (a.k.a. the van den Berg-Kesten conjecture). We use the dual… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)