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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Atmospheric processing and CCN formation of Saharan dust is illustrated through the analysis of a case of dust transport over… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
2014
2014
The Boolean satisfiability (SAT) problem is the first known example of an NPcomplete problem, and thousands of NP-compete… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2013
2013
In the random oracle model, parties are given oracle access to a random function (i.e., a uniformly chosen function from the set… (More)
Is this relevant?
2010
2007
2007
[1] Surface-active organics such as humic-like substances (HULIS) are abundant in aerosol particles and can lower the surface… (More)
  • figure 1
  • table 1
  • figure 2
Is this relevant?
2000
2000
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… (More)
Is this relevant?
Highly Cited
2000
Highly Cited
2000
In this paper we study the relationships among some of the mostfitndamental primitives and protocols in cryptography: public-key… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2000
Highly Cited
2000
A central focus of modern cryptography is the construction of efficient, “high-level” cryptographic tools (e.g., encryption… (More)
Is this relevant?
Highly Cited
1996
Highly Cited
1996
The race to find the weakest possible assumptions on which to base cryptographic primitives such aa oblivious transfer was… (More)
  • figure 1
Is this relevant?