bibliographer - Samir Datta

bibliographer a curated TCS bibliography

obsidian
tags
authors
no doi
no pdf
bad author
add item
librarian

Low-Depth Uniform Threshold Circuits and the Bit-Complexity of Straight Line Programs Eric Allender Nikhil Balaji Samir Datta [github]

On the complexity of algebraic numbers, and the bit-complexity of straight-line programs 1 Eric Allender Nikhil Balaji Samir Datta Rameshwar Pratap [github]

Counting classes and the fine structure between NC1 and L Samir Datta Meena Mahajan B.V. Raghavendra Rao Michael Thomas Heribert Vollmer [github]

Planar Graph Isomorphism is in Log-Space Samir Datta Nutan Limaye Prajakta Nimbhorkar Thomas Thierauf Fabian Wagner [github]

Dynamic Complexity of Reachability: How Many Changes Can We Handle Samir Datta Pankaj Kumar Anish Mukherjee Anuj Tawari Nils Vortmeier Thomas Zeume [github]

Space complexity of perfect matching in bounded genus bipartite graphs Samir Datta Raghav Kulkarni Raghunath Tewari N.V. Vinodchandran [github]

Planar Graph Isomorphism is in Log-Space Samir Datta Nutan Limaye Prajakta Nimbhorkar Thomas Thierauf Fabian Wagner [github]

Reachability Is in DynFO Samir Datta Raghav Kulkarni Anish Mukherjee Thomas Schwentick Thomas Zeume [github]

Library Size: 13G (8 entries), Last Updated: Apr 04, 2026, 18:14:59, Build Time: N/A

[show logs] [hide logs]