default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNutan Limaye
Person information
- affiliation: IT University of Copenhagen, Denmark
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j26]Prasad Chaugule, Nutan Limaye:
On The Closures of Monotone Algebraic Classes and Variants of the Determinant. Algorithmica 86(7): 2130-2151 (2024)- [j25]Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas:
Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits. Commun. ACM 67(2): 101-108 (2024) - [c40]Hervé Fournier, Nutan Limaye
, Srikanth Srinivasan, Sébastien Tavenas:
On the Power of Homogeneous Algebraic Formulas. STOC 2024: 141-151 - [c39]Tuomas Hakoniemi, Nutan Limaye, Iddo Tzameret:
Functional Lower Bounds in Algebraic Proofs: Symmetry, Lifting, and Barriers. STOC 2024: 1396-1404 - [i51]Per Austrin, Ioana O. Bercea, Mayank Goswami, Nutan Limaye, Adarsh Srinivasan:
On the geometry of k-SAT solutions: what more can PPZ and Schöning's algorithms do? CoRR abs/2408.03465 (2024) - [i50]Prasad Chaugule, Nutan Limaye:
On the closures of monotone algebraic classes and variants of the determinant. Electron. Colloquium Comput. Complex. TR24 (2024) - [i49]Tuomas Hakoniemi, Nutan Limaye, Iddo Tzameret:
Functional Lower Bounds in Algebraic Proofs: Symmetry, Lifting, and Barriers. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [j24]Prasad Chaugule, Mrinal Kumar, Nutan Limaye, Chandra Kanta Mohapatra, Adrian She, Srikanth Srinivasan:
Schur Polynomials Do Not Have Small Formulas If the Determinant does not. Comput. Complex. 32(1): 3 (2023) - [c38]Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan, Sébastien Tavenas:
Towards Optimal Depth-Reductions for Algebraic Formulas. CCC 2023: 28:1-28:19 - [i48]Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan, Sébastien Tavenas:
Towards Optimal Depth-Reductions for Algebraic Formulas. CoRR abs/2302.06984 (2023) - [i47]Hervé Fournier, Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas:
On the Power of Homogeneous Algebraic Formulas. Electron. Colloquium Comput. Complex. TR23 (2023) - [i46]Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan, Sébastien Tavenas:
Towards Optimal Depth-Reductions for Algebraic Formulas. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [j23]Swapnam Bajpai, Vaibhav Krishan, Deepanshu Kush, Nutan Limaye, Srikanth Srinivasan:
A #SAT Algorithm for Small Constant-Depth Circuits with PTF gates. Algorithmica 84(4): 1132-1162 (2022) - [j22]Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas:
Guest Column: Lower Bounds Against Constant-Depth Algebraic Circuits. SIGACT News 53(2): 40-62 (2022) - [j21]Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner:
Planar Graph Isomorphism Is in Log-Space. ACM Trans. Comput. Theory 14(2): 8:1-8:33 (2022) - [c37]Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas:
On the Partial Derivative Method Applied to Lopsided Set-Multilinear Polynomials. CCC 2022: 32:1-32:23 - [c36]Radu Curticapean, Nutan Limaye, Srikanth Srinivasan:
On the VNP-Hardness of Some Monomial Symmetric Polynomials. FSTTCS 2022: 16:1-16:14 - [c35]Prasad Chaugule, Nutan Limaye:
On the Closures of Monotone Algebraic Classes and Variants of the Determinant. LATIN 2022: 610-625 - [c34]Sébastien Tavenas, Nutan Limaye, Srikanth Srinivasan:
Set-multilinear and non-commutative formula lower bounds for iterated matrix multiplication. STOC 2022: 416-425 - [i45]Radu Curticapean, Nutan Limaye, Srikanth Srinivasan:
On the VNP-hardness of Some Monomial Symmetric Polynomials. Electron. Colloquium Comput. Complex. TR22 (2022) - [i44]Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas:
On the Partial Derivative Method Applied to Lopsided Set-Multilinear Polynomials. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [j20]Nutan Limaye, Karteek Sreenivasaiah, Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh:
A Fixed-Depth Size-Hierarchy Theorem for $\mathrm{AC}^0[\oplus]$ via the Coin Problem. SIAM J. Comput. 50(4): 1461-1499 (2021) - [j19]Prasad Chaugule, Nutan Limaye, Aditya Varre:
Variants of Homomorphism Polynomials Complete for Algebraic Complexity Classes. ACM Trans. Comput. Theory 13(4): 21:1-21:26 (2021) - [c33]Prasad Chaugule, Nutan Limaye, Shourya Pandey:
Variants of the Determinant Polynomial and the VP-Completeness. CSR 2021: 31-55 - [c32]Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas:
Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits. FOCS 2021: 804-814 - [i43]Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas:
Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits. Electron. Colloquium Comput. Complex. TR21 (2021) - [i42]Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas:
New Non-FPT Lower Bounds for Some Arithmetic Formulas. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j18]Nikhil Balaji, Andreas Krebs, Nutan Limaye:
Skew circuits of small width. Theor. Comput. Sci. 821: 111-123 (2020) - [c31]Prasad Chaugule, Mrinal Kumar, Nutan Limaye, Chandra Kanta Mohapatra, Adrian She, Srikanth Srinivasan:
Schur Polynomials Do Not Have Small Formulas If the Determinant Doesn't. CCC 2020: 14:1-14:27 - [i41]Prasad Chaugule, Nutan Limaye, Shourya Pandey:
Variants of the Determinant polynomial and VP-completeness. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [j17]Guillaume Lagarde, Nutan Limaye, Srikanth Srinivasan:
Lower Bounds and PIT for Non-commutative Arithmetic Circuits with Restricted Parse Trees. Comput. Complex. 28(3): 471-542 (2019) - [j16]Suryajith Chillara, Nutan Limaye, Srikanth Srinivasan:
Small-Depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication with Applications. SIAM J. Comput. 48(1): 70-92 (2019) - [c30]Prasad Chaugule, Nutan Limaye, Aditya Varre:
Variants of Homomorphism Polynomials Complete for Algebraic Complexity Classes. COCOON 2019: 90-102 - [c29]Nutan Limaye, Srikanth Srinivasan, Utkarsh Tripathi:
More on AC^0[oplus] and Variants of the Majority Function. FSTTCS 2019: 22:1-22:14 - [c28]Swapnam Bajpai, Vaibhav Krishan, Deepanshu Kush, Nutan Limaye, Srikanth Srinivasan:
A #SAT Algorithm for Small Constant-Depth Circuits with PTF Gates. ITCS 2019: 8:1-8:20 - [c27]Nutan Limaye, Karteek Sreenivasaiah, Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh:
A fixed-depth size-hierarchy theorem for AC0[⊕] via the coin problem. STOC 2019: 442-453 - [i40]Prasad Chaugule, Mrinal Kumar, Nutan Limaye, Chandra Kanta Mohapatra, Adrian She, Srikanth Srinivasan:
Schur Polynomials do not have small formulas if the Determinant doesn't! CoRR abs/1911.12520 (2019) - [i39]Prasad Chaugule, Mrinal Kumar, Nutan Limaye, Chandra Kanta Mohapatra, Adrian She, Srikanth Srinivasan:
Schur Polynomials do not have small formulas if the Determinant doesn't! Electron. Colloquium Comput. Complex. TR19 (2019) - [i38]Nutan Limaye, Srikanth Srinivasan, Utkarsh Tripathi:
More on $AC^0[\oplus]$ and Variants of the Majority Function. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [c26]Suryajith Chillara, Christian Engels, Nutan Limaye, Srikanth Srinivasan:
A Near-Optimal Depth-Hierarchy Theorem for Small-Depth Multilinear Circuits. FOCS 2018: 934-945 - [c25]Suryajith Chillara, Nutan Limaye, Srikanth Srinivasan:
A Quadratic Size-Hierarchy Theorem for Small-Depth Multilinear Formulas. ICALP 2018: 36:1-36:13 - [c24]Suryajith Chillara, Nutan Limaye, Srikanth Srinivasan:
Small-depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication, with Applications. STACS 2018: 21:1-21:15 - [i37]Suryajith Chillara, Christian Engels, Nutan Limaye, Srikanth Srinivasan:
A Near-Optimal Depth-Hierarchy Theorem for Small-Depth Multilinear Circuits. CoRR abs/1804.02520 (2018) - [i36]Nutan Limaye, Karteek Sreenivasaiah, Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh:
The Coin Problem in Constant Depth: Sample Complexity and Parity Gates. CoRR abs/1809.04092 (2018) - [i35]Swapnam Bajpai, Vaibhav Krishan, Deepanshu Kush, Nutan Limaye, Srikanth Srinivasan:
A #SAT Algorithm for Small Constant-Depth Circuits with PTF gates. CoRR abs/1809.05932 (2018) - [i34]Swapnam Bajpai, Vaibhav Krishan, Deepanshu Kush, Nutan Limaye, Srikanth Srinivasan:
A #SAT Algorithm for Small Constant-Depth Circuits with PTF gates. Electron. Colloquium Comput. Complex. TR18 (2018) - [i33]Prasad Chaugule, Nutan Limaye, Aditya Varre:
Variants of Homomorphism Polynomials Complete for Algebraic Complexity Classes. Electron. Colloquium Comput. Complex. TR18 (2018) - [i32]Suryajith Chillara, Christian Engels, Nutan Limaye, Srikanth Srinivasan:
A Near-Optimal Depth-Hierarchy Theorem for Small-Depth Multilinear Circuits. Electron. Colloquium Comput. Complex. TR18 (2018) - [i31]Nutan Limaye, Karteek Sreenivasaiah, Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh:
The Coin Problem in Constant Depth: Sample Complexity and Parity gates. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [j15]Neeraj Kayal, Nutan Limaye, Chandan Saha, Srikanth Srinivasan:
An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas. SIAM J. Comput. 46(1): 307-335 (2017) - [j14]Hervé Fournier, Nutan Limaye, Meena Mahajan, Srikanth Srinivasan:
The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials. Theory Comput. 13(1): 1-34 (2017) - [j13]Pooja Vyavahare, Nutan Limaye, Ajit A. Diwan, D. Manjunath:
On the Maximum Rate of Networked Computation in a Capacitated Network. IEEE/ACM Trans. Netw. 25(4): 2444-2458 (2017) - [c23]Andreas Krebs, Nutan Limaye, Michael Ludwig:
A Unified Method for Placing Problems in Polylogarithmic Depth. FSTTCS 2017: 36:36-36:15 - [c22]Guillaume Lagarde, Nutan Limaye, Srikanth Srinivasan:
Lower Bounds and PIT for Non-Commutative Arithmetic Circuits with Restricted Parse Trees. MFCS 2017: 41:1-41:14 - [i30]Suryajith Chillara, Nutan Limaye, Srikanth Srinivasan:
Small-depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication, with Applications. CoRR abs/1710.05481 (2017) - [i29]Suryajith Chillara, Nutan Limaye, Srikanth Srinivasan:
Small-depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication, with Applications. Electron. Colloquium Comput. Complex. TR17 (2017) - [i28]Andreas Krebs, Nutan Limaye, Michael Ludwig:
A Unified Method for Placing Problems in Polylogarithmic Depth. Electron. Colloquium Comput. Complex. TR17 (2017) - [i27]Guillaume Lagarde, Nutan Limaye, Srikanth Srinivasan:
Lower Bounds and PIT for Non-Commutative Arithmetic circuits with Restricted Parse Trees. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [j12]Nutan Limaye, Guillaume Malod, Srikanth Srinivasan:
Lower Bounds for Non-Commutative Skew Circuits. Theory Comput. 12(1): 1-38 (2016) - [j11]Anna Gál, Jing-Tang Jang, Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah:
Space-Efficient Approximations for Subset Sum. ACM Trans. Comput. Theory 8(4): 16:1-16:28 (2016) - [j10]Andreas Krebs, Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah:
Small Depth Proof Systems. ACM Trans. Comput. Theory 9(1): 2:1-2:26 (2016) - [j9]Pooja Vyavahare, Nutan Limaye, D. Manjunath:
Optimal Embedding of Functions for In-Network Computation: Complexity Analysis and Algorithms. IEEE/ACM Trans. Netw. 24(4): 2019-2032 (2016) - [c21]Andreas Krebs, Nutan Limaye, Michael Ludwig:
Cost Register Automata for Nested Words. COCOON 2016: 587-598 - [i26]Nikhil Balaji, Nutan Limaye, Srikanth Srinivasan:
An Almost Cubic Lower Bound for ΣΠΣ Circuits Computing a Polynomial in VP. Electron. Colloquium Comput. Complex. TR16 (2016) - [i25]Vaibhav Krishan, Nutan Limaye:
Isolation Lemma for Directed Reachability and NL vs. L. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j8]Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan:
Lower Bounds for Depth-4 Formulas Computing Iterated Matrix Multiplication. SIAM J. Comput. 44(5): 1173-1201 (2015) - [c20]Nikhil Balaji, Andreas Krebs, Nutan Limaye:
Skew Circuits of Small Width. COCOON 2015: 199-210 - [c19]Hervé Fournier, Nutan Limaye, Meena Mahajan, Srikanth Srinivasan:
The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials. MFCS (2) 2015: 324-335 - [i24]Pooja Vyavahare, Nutan Limaye, D. Manjunath:
On the Maximum Rate of Networked Computation in a Capacitated Network. CoRR abs/1507.04234 (2015) - [i23]Michaël Cadilhac, Andreas Krebs, Nutan Limaye:
Value Automata with Filters. CoRR abs/1510.02393 (2015) - [i22]Hervé Fournier, Nutan Limaye, Meena Mahajan, Srikanth Srinivasan:
The shifted partial derivative complexity of Elementary Symmetric Polynomials. Electron. Colloquium Comput. Complex. TR15 (2015) - [i21]Nutan Limaye, Guillaume Malod, Srikanth Srinivasan:
Lower bounds for non-commutative skew circuits. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [c18]Pooja Vyavahare, Majid Mahzoon, Pulkit Grover, Nutan Limaye, D. Manjunath:
Information friction limits on computation. Allerton 2014: 93-100 - [c17]Neeraj Kayal, Nutan Limaye, Chandan Saha, Srikanth Srinivasan:
An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas. FOCS 2014: 61-70 - [c16]Neeraj Kayal, Nutan Limaye, Chandan Saha, Srikanth Srinivasan:
Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas. STOC 2014: 119-127 - [c15]Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan:
Lower bounds for depth 4 formulas computing iterated matrix multiplication. STOC 2014: 128-135 - [i20]Pooja Vyavahare, Nutan Limaye, D. Manjunath:
Efficient Embedding of Functions in Weighted Communication Networks. CoRR abs/1401.2518 (2014) - [i19]Nikhil Balaji, Andreas Krebs, Nutan Limaye:
Skew Circuits of Small Width. Electron. Colloquium Comput. Complex. TR14 (2014) - [i18]Anna Gál, Jing-Tang Jang, Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah:
Space-Efficient Approximations for Subset Sum. Electron. Colloquium Comput. Complex. TR14 (2014) - [i17]Neeraj Kayal, Nutan Limaye, Chandan Saha, Srikanth Srinivasan:
An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [j7]Ajesh Babu, Nutan Limaye, Jaikumar Radhakrishnan, Girish Varma:
Streaming algorithms for language recognition problems. Theor. Comput. Sci. 494: 13-23 (2013) - [c14]Andreas Krebs, Nutan Limaye:
DLOGTIME Proof Systems. FSTTCS 2013: 189-200 - [c13]Andreas Krebs, Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah:
Small Depth Proof Systems. MFCS 2013: 583-594 - [i16]Andreas Krebs, Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah:
Small Depth Proof Systems. CoRR abs/1307.4897 (2013) - [i15]Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan:
Lower bounds for depth 4 formulas computing iterated matrix multiplication. Electron. Colloquium Comput. Complex. TR13 (2013) - [i14]Andreas Krebs, Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah:
Small Depth Proof Systems. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [j6]Andreas Krebs, Nutan Limaye, Meena Mahajan:
Counting Paths in VPA Is Complete for #NC 1. Algorithmica 64(2): 279-294 (2012) - [c12]Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah:
The Complexity of Unary Subset Sum. COCOON 2012: 458-469 - [i13]Andreas Krebs, Nutan Limaye, Srikanth Srinivasan:
Streaming algorithms for recognizing nearly well-parenthesized expressions. CoRR abs/1206.0206 (2012) - [i12]Pooja Vyavahare, Nutan Limaye, D. Manjunath:
In-Network Estimation of Frequency Moments. CoRR abs/1210.6134 (2012) - [i11]Andreas Krebs, Nutan Limaye:
DLOGTIME-Proof Systems. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [c11]Andreas Krebs, Nutan Limaye, Srikanth Srinivasan:
Streaming Algorithms for Recognizing Nearly Well-Parenthesized Expressions. MFCS 2011: 412-423 - [i10]Ajesh Babu, Nutan Limaye, Jaikumar Radhakrishnan, Girish Varma:
Streaming algorithms for language recognition problems. CoRR abs/1104.0848 (2011) - 2010
- [j5]Nutan Limaye, Meena Mahajan, Prajakta Nimbhorkar:
Longest Paths in Planar DAGs in Unambiguous Log-Space. Chic. J. Theor. Comput. Sci. 2010 (2010) - [j4]Nutan Limaye, Meena Mahajan, B. V. Raghavendra Rao:
Arithmetizing Classes Around NC\textsf{NC}1 and L\textsf{L}. Theory Comput. Syst. 46(3): 499-522 (2010) - [j3]Samir Datta, Raghav Kulkarni, Nutan Limaye, Meena Mahajan:
Planarity, Determinants, Permanents, and (Unique) Matchings. ACM Trans. Comput. Theory 1(3): 10:1-10:20 (2010) - [c10]Andreas Krebs, Nutan Limaye, Meena Mahajan:
Counting Paths in VPA Is Complete for #NC1. COCOON 2010: 44-53 - [c9]Ajesh Babu, Nutan Limaye, Girish Varma:
Streaming Algorithms for Some Problems in Log-Space. TAMC 2010: 94-104 - [i9]Ajesh Babu, Nutan Limaye, Girish Varma:
Streaming algorithms for some problems in log-space. Electron. Colloquium Comput. Complex. TR10 (2010) - [i8]Andreas Krebs, Nutan Limaye, Meena Mahajan:
Counting paths in VPA is complete for #NC1. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [j2]Nutan Limaye, Meena Mahajan, Jayalal Sarma:
Upper Bounds for Monotone Planar Circuit Value and Variants. Comput. Complex. 18(3): 377-412 (2009) - [j1]Nutan Limaye, Meena Mahajan, Antoine Meyer:
On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata. J. Autom. Lang. Comb. 14(3/4): 211-235 (2009) - [c8]Nutan Limaye, Meena Mahajan, Prajakta Nimbhorkar:
Longest Paths in Planar DAGs in Unambiguous Logspace. CATS 2009: 99-105 - [c7]Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner:
Planar Graph Isomorphism is in Log-Space. CCC 2009: 203-214 - [c6]Nutan Limaye, Meena Mahajan:
Membership Testing: Removing Extra Stacks from Multi-stack Pushdown Automata. LATA 2009: 493-504 - [i7]Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner:
Planar Graph Isomorphism is in Log-Space. Algebraic Methods in Computational Complexity 2009 - [i6]Fabian Wagner, Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf:
Planar Graph Isomorphism is in Log-space. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [c5]Nutan Limaye, Meena Mahajan, Antoine Meyer:
On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata. CSR 2008: 240-251 - [c4]Samir Datta, Nutan Limaye, Prajakta Nimbhorkar:
3-connected Planar Graph Isomorphism is in Log-space. FSTTCS 2008: 155-162 - [i5]Nutan Limaye, Meena Mahajan, Prajakta Nimbhorkar:
Longest paths in Planar DAGs in Unambiguous Logspace. CoRR abs/0802.1699 (2008) - [i4]Samir Datta, Nutan Limaye, Prajakta Nimbhorkar:
3-connected Planar Graph Isomorphism is in Log-space. CoRR abs/0806.1041 (2008) - [i3]Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner:
A Log-space Algorithm for Canonization of Planar Graphs. CoRR abs/0809.2319 (2008) - 2007
- [c3]Samir Datta, Raghav Kulkarni, Nutan Limaye, Meena Mahajan:
Planarity, Determinants, Permanents, and (Unique) Matchings. CSR 2007: 115-126 - [c2]Nutan Limaye, Meena Mahajan, B. V. Raghavendra Rao:
Arithmetizing Classes Around NC 1 and L. STACS 2007: 477-488 - [i2]Nutan Limaye, Meena Mahajan, B. V. Raghavendra Rao:
Arithmetizing classes around NC^1 and L. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [c1]Nutan Limaye, Meena Mahajan, Jayalal Sarma:
Evaluating Monotone Circuits on Cylinders, Planes and Tori. STACS 2006: 660-671 - [i1]Nutan Limaye, Meena Mahajan, Jayalal Sarma:
Evaluating Monotone Circuits on Cylinders, Planes and Tori. Electron. Colloquium Comput. Complex. TR06 (2006)
Coauthor Index
[j25] [c40] [j24] [c38] [i48] [i47] [i46] [j23] [j22] [c37] [c36] [c34] [i45] [i44] [j20] [c32] [i43] [i42] [c31] [j17] [j16] [c29] [c28] [c27] [i40] [i39] [i38] [c26] [c25] [c24] [i37] [i36] [i35] [i34] [i32] [i31] [j15] [j14] [c22] [i30] [i29] [i27] [j12] [i26] [j8] [c19] [i22] [i21] [c17] [c16] [c15] [i17] [i15] [i13] [c11]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:07 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
