default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMeena Mahajan
Person information
- affiliation: Institute of Mathematical Sciences, Chennai, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j63]Yogesh Dahiya
, K. Vignesh, Meena Mahajan, Karteek Sreenivasaiah:
Linear threshold functions in decision lists, decision trees, and depth-2 circuits. Inf. Process. Lett. 183: 106418 (2024)- [j62]Abhimanyu Choudhury, Meena Mahajan:
Dependency Schemes in CDCL-Based QBF Solving: A Proof-Theoretic Study. J. Autom. Reason. 68(3): 16 (2024) - [j61]Meena Mahajan, Gaurav Sood:
QBF Merge Resolution is powerful but unnatural. Log. Methods Comput. Sci. 20(3) (2024) - [j60]Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan, Tomás Peitl, Gaurav Sood:
Hard QBFs for Merge Resolution. ACM Trans. Comput. Theory 16(2): 6:1-6:24 (2024) - [c56]Olaf Beyersdorff, Benjamin Böhm, Meena Mahajan:
Runtime vs. Extracted Proof Size: An Exponential Gap for CDCL on QBFs. AAAI 2024: 7943-7951 - [c55]Yogesh Dahiya, Meena Mahajan, Sasank Mouli:
New Lower Bounds for Polynomial Calculus over Non-Boolean Bases. SAT 2024: 10:1-10:20 - 2023
- [j59]Yogesh Dahiya, Meena Mahajan:
On (simple) decision tree rank. Theor. Comput. Sci. 978: 114177 (2023) - [j58]Yuval Filmus, Meena Mahajan, Gaurav Sood, Marc Vinyals:
MaxSAT Resolution and Subcube Sums. ACM Trans. Comput. Log. 24(1): 8:1-8:27 (2023) - [j57]Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan, Tomás Peitl:
Hardness Characterisations and Size-width Lower Bounds for QBF Resolution. ACM Trans. Comput. Log. 24(2): 10:1-10:30 (2023) - [c54]Abhimanyu Choudhury, Meena Mahajan:
Dependency Schemes in CDCL-Based QBF Solving: A Proof-Theoretic Study. FSTTCS 2023: 38:1-38:18 - [c53]Arkadev Chattopadhyay, Yogesh Dahiya, Meena Mahajan:
Query Complexity of Search Problems. MFCS 2023: 34:1-34:15 - [e3]Meena Mahajan, Friedrich Slivovsky:
26th International Conference on Theory and Applications of Satisfiability Testing, SAT 2023, July 4-8, 2023, Alghero, Italy. LIPIcs 271, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-286-0 [contents] - [i58]Anna Gál, Meena Mahajan, Rahul Santhanam, Till Tantau, Manaswi Paraashar:
Computational Complexity of Discrete Problems (Dagstuhl Seminar 23111). Dagstuhl Reports 13(3): 17-31 (2023) - [i57]Arkadev Chattopadhyay, Yogesh Dahiya, Meena Mahajan:
Query Complexity of Search Problems. Electron. Colloquium Comput. Complex. TR23 (2023) - [i56]Abhimanyu Choudhury, Meena Mahajan:
Dependency schemes in CDCL-based QBF solving: a proof-theoretic study. Electron. Colloquium Comput. Complex. TR23 (2023) - [i55]Yogesh Dahiya, Meena Mahajan, Sasank Mouli:
New lower bounds for Polynomial Calculus over non-Boolean bases. Electron. Colloquium Comput. Complex. TR23 (2023) - [i54]Yogesh Dahiya, K. Vignesh, Meena Mahajan, Karteek Sreenivasaiah:
Linear threshold functions in decision lists, decision trees, and depth-2 circuits. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [c52]Meena Mahajan, Gaurav Sood:
QBF Merge Resolution Is Powerful but Unnatural. SAT 2022: 22:1-22:19 - [i53]Meena Mahajan, Gaurav Sood:
QBF Merge Resolution is powerful but unnatural. CoRR abs/2205.13428 (2022) - [i52]Yogesh Dahiya, Meena Mahajan:
On (Simple) Decision Tree Rank. CoRR abs/2209.12877 (2022) - [i51]Yogesh Dahiya, Meena Mahajan:
On (Simple) Decision Tree Rank. Electron. Colloquium Comput. Complex. TR22 (2022) - [i50]Meena Mahajan, Gaurav Sood:
QBF Merge Resolution is powerful but unnatural. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [j56]Meena Mahajan:
The Presburger Award for Young Scientists 2022 - Call for Nominations. Bull. EATCS 135 (2021) - [j55]Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan:
Building Strategies into QBF Proofs. J. Autom. Reason. 65(1): 125-154 (2021) - [c51]Yogesh Dahiya, Meena Mahajan:
On (Simple) Decision Tree Rank. FSTTCS 2021: 15:1-15:16 - [i49]Anna Gál, Meena Mahajan, Rahul Santhanam, Till Tantau:
Computational Complexity of Discrete Problems (Dagstuhl Seminar 21121). Dagstuhl Reports 11(2): 1-16 (2021) - 2020
- [j54]Arkadev Chattopadhyay, Meena Mahajan, Nikhil S. Mande, Nitin Saurabh:
Lower bounds for linear decision lists. Chic. J. Theor. Comput. Sci. 2020 (2020) - [j53]Thore Husfeldt, Meena Mahajan, Mikolaj Bojanczyk:
The Presburger Award for Young Scientists 2021 - Call for Nominations. Bull. EATCS 132 (2020) - [c50]Markus Bläser, Christian Ikenmeyer, Meena Mahajan, Anurag Pandey, Nitin Saurabh:
Algebraic Branching Programs, Border Complexity, and Tangent Spaces. CCC 2020: 21:1-21:24 - [c49]Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan, Tomás Peitl, Gaurav Sood:
Hard QBFs for Merge Resolution. FSTTCS 2020: 12:1-12:15 - [c48]Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan:
Hardness Characterisations and Size-Width Lower Bounds for QBF Resolution. LICS 2020: 209-223 - [c47]Yuval Filmus, Meena Mahajan, Gaurav Sood, Marc Vinyals:
MaxSAT Resolution and Subcube Sums. SAT 2020: 295-311 - [i48]Markus Bläser, Christian Ikenmeyer, Meena Mahajan, Anurag Pandey, Nitin Saurabh:
Algebraic Branching Programs, Border Complexity, and Tangent Spaces. CoRR abs/2003.04834 (2020) - [i47]Yuval Filmus, Meena Mahajan, Gaurav Sood, Marc Vinyals:
MaxSAT Resolution and Subcube Sums. CoRR abs/2005.11589 (2020) - [i46]Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan, Tomás Peitl, Gaurav Sood:
Hard QBFs for Merge Resolution. CoRR abs/2012.06779 (2020) - [i45]Olaf Beyersdorff, Uwe Egly, Meena Mahajan, Cláudia Nalon:
SAT and Interactions (Dagstuhl Seminar 20061). Dagstuhl Reports 10(2): 1-18 (2020) - [i44]Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan:
Hardness Characterisations and Size-Width Lower Bounds for QBF Resolution. Electron. Colloquium Comput. Complex. TR20 (2020) - [i43]Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan, Tomás Peitl, Gaurav Sood:
Hard QBFs for Merge Resolution. Electron. Colloquium Comput. Complex. TR20 (2020) - [i42]Markus Bläser, Christian Ikenmeyer, Meena Mahajan, Anurag Pandey, Nitin Saurabh:
Algebraic Branching Programs, Border Complexity, and Tangent Spaces. Electron. Colloquium Comput. Complex. TR20 (2020) - [i41]Yuval Filmus, Meena Mahajan, Gaurav Sood, Marc Vinyals:
MaxSAT Resolution and Subcube Sums. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [j52]Meena Mahajan, Madhavan Mukund, Nitin Saxena:
Research in theoretical computer science. Commun. ACM 62(11): 92-95 (2019) - [j51]Thore Husfeldt, Meena Mahajan, Anca Muscholl:
The Presburger Award for Young Scientists 2020 - Call for Nominations. Bull. EATCS 129 (2019) - [c46]Olaf Beyersdorff, Leroy Chew, Judith Clymo, Meena Mahajan:
Short Proofs in QBF Expansion. SAT 2019: 19-35 - [c45]Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan:
Building Strategies into QBF Proofs. STACS 2019: 14:1-14:18 - [i40]Arkadev Chattopadhyay, Meena Mahajan, Nikhil S. Mande, Nitin Saurabh:
Lower Bounds for Linear Decision Lists. CoRR abs/1901.05911 (2019) - [i39]Arkadev Chattopadhyay, Meena Mahajan, Nikhil S. Mande, Nitin Saurabh:
Lower Bounds for Linear Decision Lists. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [j50]Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla:
Understanding cutting planes for QBFs. Inf. Comput. 262: 141-161 (2018) - [j49]Meena Mahajan, Nitin Saurabh:
Some Complete and Intermediate Polynomials in Algebraic Complexity Theory. Theory Comput. Syst. 62(3): 622-652 (2018) - [j48]Meena Mahajan, Anuj Tawari:
Sums of read-once formulas: How many summands are necessary? Theor. Comput. Sci. 708: 34-45 (2018) - [j47]Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla:
Are Short Proofs Narrow? QBF Resolution Is Not So Simple. ACM Trans. Comput. Log. 19(1): 1:1-1:26 (2018) - [c44]Meena Mahajan:
Lower Bound Techniques for QBF Proof Systems. STACS 2018: 2:1-2:8 - [i38]Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan:
Building Strategies into QBF Proofs. Electron. Colloquium Comput. Complex. TR18 (2018) - [i37]Olaf Beyersdorff, Leroy Chew, Judith Clymo, Meena Mahajan:
Short Proofs in QBF Expansion. Electron. Colloquium Comput. Complex. TR18 (2018) - [i36]Meena Mahajan, Prajakta Nimbhorkar, Anuj Tawari:
Computing the maximum using (min, +) formulas. Electron. Colloquium Comput. Complex. TR18 (2018) - [i35]Meena Mahajan, Prajakta Nimbhorkar, Anuj Tawari:
Shortest path length with bounded-alternation (min, +) formulas. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [j46]Vikraman Arvind, Meena Mahajan:
A Quest for Structure in Complexity. Bull. EATCS 123 (2017) - [j45]Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla:
Feasible Interpolation for QBF Resolution Calculi. Log. Methods Comput. Sci. 13(2) (2017) - [j44]Hervé Fournier, Nutan Limaye, Meena Mahajan, Srikanth Srinivasan:
The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials. Theory Comput. 13(1): 1-34 (2017) - [c43]Meena Mahajan:
Arithmetic Circuits: An Overview (Invited Talk). CSL 2017: 5:1-5:1 - [c42]Meena Mahajan, Prajakta Nimbhorkar, Anuj Tawari:
Computing the Maximum using (min, +) Formulas. MFCS 2017: 74:1-74:11 - [i34]Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla:
Understanding Cutting Planes for QBFs. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [j43]Meena Mahajan, B. V. Raghavendra Rao, Karteek Sreenivasaiah:
Building Above Read-Once Polynomials: Identity Testing and Hardness of Representation. Algorithmica 76(4): 890-909 (2016) - [j42]Arnaud Durand, Meena Mahajan, Guillaume Malod, Nicolas de Rugy-Altherre, Nitin Saurabh:
Homomorphism Polynomials Complete for VP. Chic. J. Theor. Comput. Sci. 2016 (2016) - [j41]Meena Mahajan, Nitin Saurabh, Sébastien Tavenas:
VNP=VP in the multilinear world. Inf. Process. Lett. 116(2): 179-182 (2016) - [j40]Meena Mahajan, Anil Shukla:
Level-ordered Q-resolution and tree-like Q-resolution are incomparable. Inf. Process. Lett. 116(3): 256-258 (2016) - [j39]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) - [j38]Andreas Krebs, Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah:
Small Depth Proof Systems. ACM Trans. Comput. Theory 9(1): 2:1-2:26 (2016) - [c41]Meena Mahajan, Nitin Saurabh:
Some Complete and Intermediate Polynomials in Algebraic Complexity Theory. CSR 2016: 251-265 - [c40]Meena Mahajan, Anuj Tawari:
Sums of Read-Once Formulas: How Many Summands Suffice? CSR 2016: 266-279 - [c39]Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla:
Understanding Cutting Planes for QBFs. FSTTCS 2016: 40:1-40:15 - [c38]Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla:
Are Short Proofs Narrow? QBF Resolution is not Simple. STACS 2016: 15:1-15:14 - [i33]Meena Mahajan, Anuj Tawari:
Sums of read-once formulas: How many summands suffice? CoRR abs/1603.02605 (2016) - [i32]Meena Mahajan, Nitin Saurabh:
Some Complete and Intermediate Polynomials in Algebraic Complexity Theory. CoRR abs/1603.04606 (2016) - [i31]Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla:
Feasible Interpolation for QBF Resolution Calculi. CoRR abs/1611.01328 (2016) - [i30]Andreas Krebs, Meena Mahajan, Anil Shukla:
Relating two width measures for resolution proofs. Electron. Colloquium Comput. Complex. TR16 (2016) - [i29]Meena Mahajan, Nitin Saurabh:
Some Complete and Intermediate Polynomials in Algebraic Complexity Theory. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [c37]Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla:
Feasible Interpolation for QBF Resolution Calculi. ICALP (1) 2015: 180-192 - [c36]Hervé Fournier, Nutan Limaye, Meena Mahajan, Srikanth Srinivasan:
The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials. MFCS (2) 2015: 324-335 - [i28]Meena Mahajan, Anuj Tawari:
Read-once polynomials: How many summands suffice? CoRR abs/1512.04386 (2015) - [i27]Mikolaj Bojanczyk, Meena Mahajan, Thomas Schwentick, Heribert Vollmer:
Circuits, Logic and Games (Dagstuhl Seminar 15401). Dagstuhl Reports 5(9): 105-124 (2015) - [i26]Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla:
Feasible Interpolation for QBF Resolution Calculi. Electron. Colloquium Comput. Complex. TR15 (2015) - [i25]Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla:
Are Short Proofs Narrow? QBF Resolution is not Simple. Electron. Colloquium Comput. Complex. TR15 (2015) - [i24]Hervé Fournier, Nutan Limaye, Meena Mahajan, Srikanth Srinivasan:
The shifted partial derivative complexity of Elementary Symmetric Polynomials. Electron. Colloquium Comput. Complex. TR15 (2015) - [i23]Meena Mahajan, B. V. Raghavendra Rao, Karteek Sreenivasaiah:
Building above read-once polynomials: identity testing and hardness of representation. Electron. Colloquium Comput. Complex. TR15 (2015) - [i22]Meena Mahajan, Anuj Tawari:
Sums of read-once formulas: How many summands suffice? Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [j37]Meena Mahajan, B. V. Raghavendra Rao, Karteek Sreenivasaiah:
Monomials, multilinearity and identity testing in simple read-restricted circuits. Theor. Comput. Sci. 524: 90-102 (2014) - [c35]Meena Mahajan, B. V. Raghavendra Rao, Karteek Sreenivasaiah:
Building above Read-once Polynomials: Identity Testing and Hardness of Representation. COCOON 2014: 1-12 - [c34]Arnaud Durand, Meena Mahajan, Guillaume Malod, Nicolas de Rugy-Altherre, Nitin Saurabh:
Homomorphism Polynomials Complete for VP. FSTTCS 2014: 493-504 - [i21]Arnaud Durand, Meena Mahajan, Guillaume Malod, Nicolas de Rugy-Altherre, Nitin Saurabh:
Homomorphism polynomials complete for VP. Electron. Colloquium Comput. Complex. TR14 (2014) - [i20]Anna Gál, Jing-Tang Jang, Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah:
Space-Efficient Approximations for Subset Sum. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [j36]Meena Mahajan, B. V. Raghavendra Rao:
Small Space Analogues of Valiant's Classes and the Limitations of Skew Formulas. Comput. Complex. 22(1): 1-38 (2013) - [j35]Maurice J. Jansen, Meena Mahajan, B. V. Raghavendra Rao:
Resource Trade-offs in Syntactically Multilinear Arithmetic Circuits. Comput. Complex. 22(3): 517-564 (2013) - [j34]Eric Allender, Vikraman Arvind, Meena Mahajan:
Comments on Arithmetic Complexity, Kleene Closure, and Formal Power Series. Theory Comput. Syst. 53(3): 503-506 (2013) - [j33]Olaf Beyersdorff, Samir Datta, Andreas Krebs, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer:
Verifying proofs in constant depth. ACM Trans. Comput. Theory 5(1): 2:1-2:23 (2013) - [c33]Andreas Krebs, Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah:
Small Depth Proof Systems. MFCS 2013: 583-594 - [i19]Meena Mahajan:
Algebraic Complexity Classes. CoRR abs/1307.3863 (2013) - [i18]Andreas Krebs, Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah:
Small Depth Proof Systems. CoRR abs/1307.4897 (2013) - [i17]Andreas Krebs, Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah:
Small Depth Proof Systems. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [j32]Andreas Krebs, Nutan Limaye, Meena Mahajan:
Counting Paths in VPA Is Complete for #NC 1. Algorithmica 64(2): 279-294 (2012) - [j31]Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer:
Counting classes and the fine structure between NC1 and L. Theor. Comput. Sci. 417: 36-49 (2012) - [j30]Meena Mahajan, Prajakta Nimbhorkar, Kasturi R. Varadarajan:
The planar k-means problem is NP-hard. Theor. Comput. Sci. 442: 13-21 (2012) - [c32]Meena Mahajan, Nitin Saurabh, Karteek Sreenivasaiah:
Counting paths in planar width 2 branching programs. CATS 2012: 59-68 - [c31]Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah:
The Complexity of Unary Subset Sum. COCOON 2012: 458-469 - [c30]Meena Mahajan, B. V. Raghavendra Rao, Karteek Sreenivasaiah:
Identity Testing, Multilinearity Testing, and Monomials in Read-Once/Twice Formulas and Branching Programs. MFCS 2012: 655-667 - [i16]Olaf Beyersdorff, Samir Datta, Andreas Krebs, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer:
Verifying Proofs in Constant Depth. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [c29]Olaf Beyersdorff, Samir Datta, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer:
Verifying Proofs in Constant Depth. MFCS 2011: 84-95 - 2010
- [j29]Nutan Limaye, Meena Mahajan, Prajakta Nimbhorkar:
Longest Paths in Planar DAGs in Unambiguous Log-Space. Chic. J. Theor. Comput. Sci. 2010 (2010) - [j28]Meena Mahajan, Jayalal Sarma:
On the Complexity of Matrix Rank and Rigidity. Theory Comput. Syst. 46(1): 9-26 (2010) - [j27]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) - [j26]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) - [c28]Andreas Krebs, Nutan Limaye, Meena Mahajan:
Counting Paths in VPA Is Complete for #NC1. COCOON 2010: 44-53 - [c27]Kamal Lodaya, Meena Mahajan:
Frontmatter, Table of Contents, Preface, Conference Organization, Author Index. FSTTCS 2010 - [c26]Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer:
Counting Classes and the Fine Structure between NC1 and L. MFCS 2010: 306-317 - [e2]Kamal Lodaya, Meena Mahajan:
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India. LIPIcs 8, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2010, ISBN 978-3-939897-23-1 [contents] - [i15]Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer:
Counting Classes and the Fine Structure between NC1 and L. Electron. Colloquium Comput. Complex. TR10 (2010) - [i14]Andreas Krebs, Nutan Limaye, Meena Mahajan:
Counting paths in VPA is complete for #NC1. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [j25]Nutan Limaye, Meena Mahajan, Jayalal Sarma:
Upper Bounds for Monotone Planar Circuit Value and Variants. Comput. Complex. 18(3): 377-412 (2009) - [j24]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) - [j23]Meena Mahajan, Venkatesh Raman, Somnath Sikdar:
Parameterizing above or below guaranteed values. J. Comput. Syst. Sci. 75(2): 137-153 (2009) - [c25]Nutan Limaye, Meena Mahajan, Prajakta Nimbhorkar:
Longest Paths in Planar DAGs in Unambiguous Logspace. CATS 2009: 99-105 - [c24]