Ran Raz (Hebrew: רָן רָז) is a computer scientist who works in the area of computational complexity theory. He is a professor in the faculty of… (More)

Semantic Scholar uses AI to extract papers important to this topic.

2013

2013

- Dmitry Gavinsky, Or Meir, Omri Weinstein, Avi Wigderson
- STOC
- 2013

One of the major open problems in complexity theory is proving super-logarithmic lower bounds on the depth of circuits (i.e., <b… (More)

Is this relevant?

2012

2012

- Michael A. Forbes, Amir Shpilka
- 2013 IEEE 54th Annual Symposium on Foundations of…
- 2012

We study the problem of obtaining efficient, deterministic, black-box polynomial identity testing algorithms (PIT) for algebraic… (More)

Is this relevant?

2010

2010

- Zhixiang Chen, Bin Fu, Yang Liu, Robert T. Schweller
- COCOA
- 2010

This paper is our second step towards developing a theory of testing monomials in multivariate polynomials. The central question… (More)

Is this relevant?

2008

2008

- Vikraman Arvind, Partha Mukhopadhyay, Srikanth Srinivasan
- computational complexity
- 2008

Using ideas from automata theory, we design the first polynomial deterministic identity testing algorithm for the sparse… (More)

Is this relevant?

2007

2007

- Emanuele Viola, Avi Wigderson
- Twenty-Second Annual IEEE Conference on…
- 2007

This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty… (More)

Is this relevant?

2006

2006

- Dean H. Lorenz, Ariel Orda, Danny Raz, Yuval Shavitt
- IEEE/ACM Transactions on Networking
- 2006

In this paper, we study problems related to supporting unicast and multicast connections with quality of service (QoS… (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- Hartmut Klauck
- FOCS
- 2001

We prove new lower bounds for bounded error quantum communication complexity. Our methods are based on the Fourier transform of… (More)

Is this relevant?

2001

2001

- Jan Johannsen
- ITA
- 2001

The depth hierarchy results for monotone circuits of Raz and McKenzie [5] are extended to the case of monotone circuits of… (More)

Is this relevant?

1991

1991

- Jeff Edmonds, Steven Rudich, Russell Impagliazzo, Jirí Sgall
- computational complexity
- 1991

Karchmer, Raz, and Wigderson (1995) discuss the circuit depth complexity of n-bit Boolean functions constructed by composing up… (More)

Is this relevant?

1987

1987

A new family of exact solutions of the scalar Helmholtz equation is presented. The 0, 0 order of this family represents a new… (More)

Is this relevant?