Searching for authors named "Samir Datta" – sorted by Relevance.
-
DETERMINISTICALLY ISOLATING A PERFECT MATCHING IN BIPARTITE PLANAR GRAPHS
- DETERMINISTICALLY ISOLATING A PERFECT MATCHING IN BIPARTITE PLANAR GRAPHS SAMIR DATTA 1 , RAGHAV
- Add To MetaCart
-
Efficient Channel Reservation for Backup Paths in Optical Mesh Networks
- Sengupta ¶ , Subir Biswas ¶ , and Samir Datta ¶ *Electrical Engg., Princeton University, Princeton, NJ
- Cited by 7 (0 self) – Add To MetaCart
-
The directed planar reachability problem
- The Directed Planar Reachability Problem Eric Allender 1 , Samir Datta 2 , and Sambuddha Roy 3 1
- Cited by 13 (7 self) – Add To MetaCart
-
On TC^0, AC^0, and Arithmetic Circuits
- Science Rutgers University Piscataway, NJ 08855, USA allender@(email omitted); Samir Datta ‡ Department
- Cited by 12 (4 self) – Add To MetaCart
-
is in Log-space
- . Hariharan, M. Mukund, V. Vinay; pp 155-162 3-connectedPlanarGraphIsomorphism is in Log-space Samir Datta 1
- Add To MetaCart
-
Characterizing Small Depth and Small Space Classes by Operators of Higher Types
- @(email omitted); Samir Datta z Department of Computer Science, Rutgers University Piscataway, NJ 08855, USA e
- Add To MetaCart
-
Grid Graph Reachability Problems
- ‡ Samir Datta § Abstract We study the complexity of restricted versions of stconnectivity, which
- Cited by 8 (6 self) – Add To MetaCart
-
Bounded Depth Arithmetic Circuits: Counting and Closure
- Division of Computer Science University of California, Berkeley ambainis@(email omitted); Samir Datta
- Cited by 7 (2 self) – Add To MetaCart

