( en | de | ru )

 

Disambiguation of "Datta, Samir"

Author of the publication

copydeleteadd this publication to your clipboard
Counting Classes and the Fine Structure between NC1 and L.

, , , , and . Electron. Colloquium Comput. Complex., (2010)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Alireza Samir

Proyag Datta

Asit Datta

Kais al- Samir

Samer al- Samir

 

Other publications of authors with the same name

Computing Bits of Algebraic Numbers, and . CoRR, (2011)Log-space Algorithms for Paths and Matchings in k-trees, , and . CoRR, (2009)Distributed Sleep-Scheduling Protocols for Energy Conservation in Wireless Networks., , and . HICSS, IEEE Computer Society, (2005)Perfect Matching in Bipartite Planar Graphs is in UL., , and . Electron. Colloquium Comput. Complex., (2010)Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs., , and . Theory Comput. Syst., 47 (3): 737-757 (2010)Parallel Polynomial Permanent Mod Powers of 2 and Shortest Disjoint Cycles., and . MFCS, volume 202 of LIPIcs, page 36:1-36:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Dynamic Complexity of Expansion., , and . CSR, volume 12730 of Lecture Notes in Computer Science, page 56-77. Springer, (2021)USSR is in P/poly., and . CoRR, (2023)Dynamic Meta-Theorems for Distance and Matching., , , , , and . ICALP, volume 229 of LIPIcs, page 118:1-118:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Space complexity: what makes planar graphs special?, and . Bull. EATCS, (2013)