Juri L. Baskakov

According to our database, Juri L. Baskakov authored at least 2 papers between 1997 and 1999.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

1999

Small Pseudo-Random Sets Yield Hard Functions: New Tight Explict Lower Bounds for Branching Programs.

Alexander E. Andreev, Juri L. Baskakov, Andrea E. F. Clementi, José D. P. Rolim

Proceedings of the Automata, 1999

1997

Small Random Sets for Affine Spaces and Better Explicit Lower Bounds for Branching Programs

Alexander E. Andreev, Juri L. Baskakov, Andrea E. F. Clementi, José D. P. Rolim

Electron. Colloquium Comput. Complex., 1997