default search action
Nitin Saxena 0001
Person information
- affiliation: ITT Kanpur, India
- award (2006): Gödel Prize
- award (2006): Fulkerson Prize
Other persons with the same name
- Nitin Saxena 0002 — Thapar Institute of Engineering & Technology, India (and 1 more)
- Nitin Saxena 0003 — Freescale Semiconductor, India
- Nitin Saxena 0004 — Western Water, Sunbury, VIC, Australia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j27]Nitin Saxena
:
How Easy Is It to Describe Hard Polynomials?: Technical Perspective. Commun. ACM 67(2): 100 (2024) - [j26]Pranjal Dutta, Nitin Saxena, Thomas Thierauf:
Weighted Sum-of-Squares Lower Bounds for Univariate Polynomials Imply VP ≠q VNP. Comput. Complex. 33(1): 3 (2024) - [j25]Sayak Chakrabarti, Ashish Dwivedi, Nitin Saxena:
Solving polynomial systems over non-fields and applications to modular polynomial factoring. J. Symb. Comput. 125: 102314 (2024) - [j24]C. S. Bhargav, Sagnik Dutta, Nitin Saxena:
Improved Lower Bound, and Proof Barrier, for Constant Depth Algebraic Circuits. ACM Trans. Comput. Theory 16(4): 23:1-23:22 (2024) - [c35]C. S. Bhargav
Learning the Coefficients: A Presentable Version of Border Complexity and Applications to Circuit Factoring. STOC 2024: 130-140 - [c34]C. S. Bhargav
Lower Bounds for the Sum of Small-Size Algebraic Branching Programs. TAMC 2024: 355-366 - 2023
- [j23]Rishabh Batra, Nitin Saxena, Devansh Shringi
Explicit construction of q+1 regular local Ramanujan graphs, for all prime-powers q. Comput. Complex. 32(1): 2 (2023) - [c33]Anindya Ganguly, Angshuman Karmakar
VDOO: A Short, Fast, Post-quantum Multivariate Digital Signature Scheme. INDOCRYPT (2) 2023: 197-222 - [c32]Sayak Chakrabarti
An effective description of the roots of bivariates mod pk and the related Igusa's local zeta function. ISSAC 2023: 135-144 - [i63]Pranjal Dutta, Prateek Dwivedi, Nitin Saxena:
Deterministic identity testing paradigms for bounded top-fanin depth-4 circuits. CoRR abs/2304.11325 (2023) - [i62]Anindya Ganguly, Angshuman Karmakar, Nitin Saxena:
VDOO: A Short, Fast, Post-Quantum Multivariate Digital Signature Scheme. CoRR abs/2312.09535 (2023) - [i61]Anindya Ganguly, Angshuman Karmakar, Nitin Saxena:
VDOO: A Short, Fast, Post-Quantum Multivariate Digital Signature Scheme. IACR Cryptol. ePrint Arch. 2023: 1925 (2023) - 2022
- [j22]Pranjal Dutta
Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring. J. ACM 69(3): 18:1-18:39 (2022) - [c31]Pranjal Dutta
Separated borders: Exponential-gap fanin-hierarchy theorem for approximative depth-3 circuits. FOCS 2022: 200-211 - [c30]Pranav Bisht
Derandomization via Symmetric Polytopes: Poly-Time Factorization of Certain Sparse Polynomials. FSTTCS 2022: 9:1-9:19 - [c29]C. S. Bhargav
Improved Lower Bound, and Proof Barrier, for Constant Depth Algebraic Circuits. MFCS 2022: 18:1-18:16 - 2021
- [j21]Pranav Bisht
Blackbox identity testing for sum of special ROABPs and its border class. Comput. Complex. 30(1): 8 (2021) - [j20]Ashish Dwivedi, Rajat Mittal, Nitin Saxena:
Efficiently factoring polynomials modulo p4. J. Symb. Comput. 104: 805-823 (2021) - [c28]Pranjal Dutta
Deterministic Identity Testing Paradigms for Bounded Top-Fanin Depth-4 Circuits. CCC 2021: 11:1-11:27 - [c27]Pranjal Dutta
Demystifying the border of depth-3 algebraic circuits. FOCS 2021: 92-103 - [c26]Pranjal Dutta, Nitin Saxena, Thomas Thierauf:
A Largish Sum-Of-Squares Implies Circuit Hardness and Derandomization. ITCS 2021: 23:1-23:21 - 2020
- [c25]Abhibhav Garg, Nitin Saxena:
Special-case algorithms for blackbox radical membership, nullstellensatz and transcendence degree. ISSAC 2020: 186-193 - [e1]Nitin Saxena
40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2020, December 14-18, 2020, BITS Pilani, K K Birla Goa Campus, Goa, India (Virtual Conference). LIPIcs 182, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2020, ISBN 978-3-95977-174-0 [contents] - [i60]Abhibhav Garg, Nitin Saxena:
Special-case Algorithms for Blackbox Radical Membership, Nullstellensatz and Transcendence Degree. CoRR abs/2006.07613 (2020) - [i59]Ashish Dwivedi, Nitin Saxena:
Computing Igusa's local zeta function of univariates in deterministic polynomial-time. CoRR abs/2006.08926 (2020) - [i58]Pranav Bisht, Nitin Saxena:
Poly-time blackbox identity testing for sum of log-variate constant-width ROABPs. Electron. Colloquium Comput. Complex. TR20 (2020) - [i57]Pranjal Dutta, Nitin Saxena, Thomas Thierauf:
Lower bounds on the sum of 25th-powers of univariates lead to complete derandomization of PIT. Electron. Colloquium Comput. Complex. TR20 (2020) - [i56]Ashish Dwivedi, Nitin Saxena:
Computing Igusa's local zeta function of univariates in deterministic polynomial-time. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [j19]Meena Mahajan
Research in theoretical computer science. Commun. ACM 62(11): 92-95 (2019) - [j18]Zeyu Guo
Algebraic Dependencies and PSPACE Algorithms in Approximative Complexity over Any Field. Theory Comput. 15: 1-30 (2019) - [c24]Ashish Dwivedi, Rajat Mittal, Nitin Saxena
Counting Basic-Irreducible Factors Mod p^k in Deterministic Poly-Time and p-Adic Applications. CCC 2019: 15:1-15:29 - [c23]Ashish Dwivedi, Rajat Mittal, Nitin Saxena
Efficiently Factoring Polynomials Modulo p4. ISSAC 2019: 139-146 - [i55]Ashish Dwivedi, Rajat Mittal, Nitin Saxena:
Efficiently factoring polynomials modulo p4. CoRR abs/1901.06628 (2019) - [i54]Ashish Dwivedi, Rajat Mittal, Nitin Saxena:
Counting basic-irreducible factors mod $p^k$ in deterministic poly-time and $p$-adic applications. CoRR abs/1902.07785 (2019) - [i53]Ashish Dwivedi, Rajat Mittal, Nitin Saxena:
Efficiently factoring polynomials modulo $p^4$. Electron. Colloquium Comput. Complex. TR19 (2019) - [i52]Ashish Dwivedi, Rajat Mittal, Nitin Saxena:
Counting basic-irreducible factors mod $p^k$ in deterministic poly-time and $p$-adic applications. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [j17]Gábor Ivanyos
Polynomial Interpolation and Identity Testing from High Powers Over Finite Fields. Algorithmica 80(2): 560-575 (2018) - [j16]Anurag Pandey, Nitin Saxena
Algebraic independence over positive characteristic: New criterion and applications to locally low-algebraic-rank circuits. Comput. Complex. 27(4): 617-670 (2018) - [c22]Zeyu Guo
Algebraic Dependencies and PSPACE Algorithms in Approximative Complexity. CCC 2018: 10:1-10:21 - [c21]Michael A. Forbes, Sumanta Ghosh, Nitin Saxena
Towards Blackbox Identity Testing of Log-Variate Circuits. ICALP 2018: 54:1-54:16 - [c20]Pranjal Dutta, Nitin Saxena
Discovering the roots: uniform closure results for algebraic classes under factoring. STOC 2018: 1152-1165 - [c19]Manindra Agrawal, Sumanta Ghosh, Nitin Saxena
Bootstrapping variables in algebraic circuits. STOC 2018: 1166-1179 - [i51]Zeyu Guo, Nitin Saxena, Amit Sinhababu:
Algebraic dependencies and PSPACE algorithms in approximative complexity. CoRR abs/1801.09275 (2018) - [i50]Manindra Agrawal, Sumanta Ghosh, Nitin Saxena:
Bootstrapping variables in algebraic circuits. Electron. Colloquium Comput. Complex. TR18 (2018) - [i49]Michael A. Forbes, Sumanta Ghosh, Nitin Saxena:
Towards blackbox identity testing of log-variate circuits. Electron. Colloquium Comput. Complex. TR18 (2018) - [i48]Zeyu Guo, Nitin Saxena, Amit Sinhababu:
Algebraic dependencies and PSPACE algorithms in approximative complexity. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [j15]Rohit Gurjar, Arpita Korwar, Nitin Saxena
Deterministic Identity Testing for Sum of Read-Once Oblivious Arithmetic Branching Programs. Comput. Complex. 26(4): 835-880 (2017) - [j14]Rohit Gurjar, Arpita Korwar, Nitin Saxena
Identity Testing for Constant-Width, and Any-Order, Read-Once Oblivious Arithmetic Branching Programs. Theory Comput. 13(1): 1-21 (2017) - [c18]Vishwas Bhargava
Irreducibility and Deterministic r-th Root Finding over Finite Fields. ISSAC 2017: 37-44 - [i47]Vishwas Bhargava, Gábor Ivanyos, Rajat Mittal, Nitin Saxena:
Irreducibility and r-th root finding over finite fields. CoRR abs/1702.00558 (2017) - [i46]Manindra Agrawal, Michael A. Forbes, Sumanta Ghosh, Nitin Saxena:
Small hitting-sets for tiny arithmetic circuits or: How to turn bad designs into good. CoRR abs/1702.07180 (2017) - [i45]Pranjal Dutta, Nitin Saxena, Amit Sinhababu:
Discovering the roots: Uniform closure results for algebraic classes under factoring. CoRR abs/1710.03214 (2017) - [i44]Manindra Agrawal, Michael A. Forbes, Sumanta Ghosh, Nitin Saxena:
Small hitting-sets for tiny arithmetic circuits or: How to turn bad designs into good. Electron. Colloquium Comput. Complex. TR17 (2017) - [i43]Vishwas Bhargava, Gábor Ivanyos, Rajat Mittal, Nitin Saxena:
Irreducibility and deterministic r-th root finding over finite fields. Electron. Colloquium Comput. Complex. TR17 (2017) - [i42]Pranjal Dutta, Nitin Saxena, Amit Sinhababu:
Discovering the roots: Uniform closure results for algebraic classes under factoring. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [j13]Manindra Agrawal, Chandan Saha, Ramprasad Saptharishi
Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth-D Occur-k Formulas and Depth-3 Transcendence Degree-k Circuits. SIAM J. Comput. 45(4): 1533-1562 (2016) - [c17]Rohit Gurjar, Arpita Korwar, Nitin Saxena
Identity Testing for Constant-Width, and Commutative, Read-Once Oblivious ABPs. CCC 2016: 29:1-29:16 - [c16]Manindra Agrawal, Nitin Saxena
Integer Factoring Using Small Algebraic Dependencies. MFCS 2016: 6:1-6:14 - [c15]Anurag Pandey, Nitin Saxena
Algebraic Independence over Positive Characteristic: New Criterion and Applications to Locally Low Algebraic Rank Circuits. MFCS 2016: 74:1-74:15 - [i41]Rohit Gurjar, Arpita Korwar, Nitin Saxena:
Identity Testing for constant-width, and commutative, read-once oblivious ABPs. CoRR abs/1601.08031 (2016) - [i40]Rohit Gurjar, Arpita Korwar, Nitin Saxena:
Identity Testing for constant-width, and commutative, read-once oblivious ABPs. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j12]Manindra Agrawal, Rohit Gurjar, Arpita Korwar, Nitin Saxena
Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits. SIAM J. Comput. 44(3): 669-697 (2015) - [c14]Rohit Gurjar, Arpita Korwar, Nitin Saxena
Deterministic Identity Testing for Sum of Read-once Oblivious Arithmetic Branching Programs. CCC 2015: 323-346 - [i39]Gábor Ivanyos, Marek Karpinski, Miklos Santha, Nitin Saxena, Igor E. Shparlinski:
Polynomial Interpolation and Identity Testing from High Powers over Finite Fields. CoRR abs/1502.06631 (2015) - 2014
- [j11]Manuel Arora, Gábor Ivanyos
Deterministic polynomial factoring and association schemes. LMS J. Comput. Math. 17(1): 123-140 (2014) - [i38]Nitin Saxena:
Progress on Polynomial Identity Testing - II. CoRR abs/1401.0976 (2014) - [i37]Manindra Agrawal, Rohit Gurjar, Arpita Korwar, Nitin Saxena:
Hitting-sets for ROABP and Sum of Set-Multilinear circuits. CoRR abs/1406.7535 (2014) - [i36]Rohit Gurjar, Arpita Korwar, Nitin Saxena, Thomas Thierauf:
Deterministic Identity Testing for Sum of Read Once ABPs. CoRR abs/1411.7341 (2014) - [i35]Manindra Agrawal, Rohit Gurjar, Arpita Korwar, Nitin Saxena:
Hitting-sets for ROABP and Sum of Set-Multilinear circuits. Electron. Colloquium Comput. Complex. TR14 (2014) - [i34]Rohit Gurjar, Arpita Korwar, Nitin Saxena, Thomas Thierauf:
Deterministic Identity Testing for Sum of Read Once ABPs. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [j10]Chandan Saha, Ramprasad Saptharishi
A Case of Depth-3 Identity Testing, Sparse Factorization and Duality. Comput. Complex. 22(1): 39-69 (2013) - [j9]Malte Beecken, Johannes Mittmann, Nitin Saxena
Algebraic independence and blackbox identity testing. Inf. Comput. 222: 2-19 (2013) - [j8]Nitin Saxena
From sylvester-gallai configurations to rank bounds: Improved blackbox identity test for depth-3 circuits. J. ACM 60(5): 33:1-33:33 (2013) - [c13]Manindra Agrawal, Chandan Saha, Nitin Saxena
Quasi-polynomial hitting-set for set-depth-Δ formulas. STOC 2013: 321-330 - [i33]Manindra Agrawal, Rohit Gurjar, Arpita Korwar, Nitin Saxena:
Hitting-sets for low-distance multilinear depth-3. CoRR abs/1312.1826 (2013) - [i32]Manindra Agrawal, Rohit Gurjar, Arpita Korwar, Nitin Saxena:
Hitting-sets for low-distance multilinear depth-3. Electron. Colloquium Comput. Complex. TR13 (2013) - [i31]Nitin Saxena:
Progress on Polynomial Identity Testing - II. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [j7]Gábor Ivanyos
Trading GRH for algebra: Algorithms for factoring polynomials and related structures. Math. Comput. 81(277): 493-531 (2012) - [j6]Nitin Saxena
Blackbox Identity Testing for Bounded Top-Fanin Depth-3 Circuits: The Field Doesn't Matter. SIAM J. Comput. 41(5): 1285-1298 (2012) - [c12]Manindra Agrawal, Chandan Saha, Ramprasad Saptharishi
Jacobian hits circuits: hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits. STOC 2012: 599-614 - [i30]Johannes Mittmann, Nitin Saxena, Peter Scheiblechner:
Algebraic Independence in Positive Characteristic -- A p-Adic Calculus. CoRR abs/1202.4301 (2012) - [i29]Manuel Arora, Gábor Ivanyos, Marek Karpinski, Nitin Saxena:
Deterministic Polynomial Factoring and Association Schemes. CoRR abs/1205.5653 (2012) - [i28]Manindra Agrawal, Chandan Saha, Nitin Saxena:
Quasi-polynomial Hitting-set for Set-depth-Delta Formulas. CoRR abs/1209.2333 (2012) - [i27]Manindra Agrawal, Chandan Saha, Nitin Saxena:
Quasi-polynomial Hitting-set for Set-depth-$\Delta$ Formulas. Electron. Colloquium Comput. Complex. TR12 (2012) - [i26]Manuel Arora, Gábor Ivanyos, Marek Karpinski, Nitin Saxena:
Deterministic Polynomial Factoring and Association Schemes. Electron. Colloquium Comput. Complex. TR12 (2012) - [i25]Johannes Mittmann, Nitin Saxena, Peter Scheiblechner:
Algebraic Independence in Positive Characteristic - A p-Adic Calculus. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j5]Nitin Saxena
An Almost Optimal Rank Bound for Depth-3 Identities. SIAM J. Comput. 40(1): 200-224 (2011) - [c11]Malte Beecken, Johannes Mittmann, Nitin Saxena
Algebraic Independence and Blackbox Identity Testing. ICALP (2) 2011: 137-148 - [c10]Nitin Saxena
Blackbox identity testing for bounded top fanin depth-3 circuits: the field doesn't matter. STOC 2011: 431-440 - [i24]Malte Beecken, Johannes Mittmann, Nitin Saxena:
Algebraic Independence and Blackbox Identity Testing. CoRR abs/1102.2789 (2011) - [i23]Manindra Agrawal, Chandan Saha, Ramprasad Saptharishi, Nitin Saxena:
Jacobian hits circuits: Hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits. CoRR abs/1111.0582 (2011) - [i22]Manindra Agrawal, Chandan Saha, Ramprasad Saptharishi, Nitin Saxena:
Jacobian hits circuits: Hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits. Electron. Colloquium Comput. Complex. TR11 (2011) - [i21]Malte Beecken, Johannes Mittmann, Nitin Saxena:
Algebraic Independence and Blackbox Identity Testing. Electron. Colloquium Comput. Complex. TR11 (2011) - [i20]Chandan Saha, Ramprasad Saptharishi, Nitin Saxena:
A Case of Depth-3 Identity Testing, Sparse Factorization and Duality. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [j4]Gábor Ivanyos
Deterministic Polynomial Time Algorithms for Matrix Completion Problems. SIAM J. Comput. 39(8): 3736-3751 (2010) - [c9]Nitin Saxena
From Sylvester-Gallai Configurations to Rank Bounds: Improved Black-Box Identity Test for Depth-3 Circuits. FOCS 2010: 21-29 - [i19]Nitin Saxena, C. Seshadhri:
From Sylvester-Gallai Configurations to Rank Bounds: Improved Black-box Identity Test for Depth-3 Circuits. CoRR abs/1002.0145 (2010) - [i18]Nitin Saxena, C. Seshadhri:
Blackbox identity testing for bounded top fanin depth-3 circuits: the field doesn't matter. CoRR abs/1011.3234 (2010) - [i17]Nitin Saxena, C. Seshadhri:
From Sylvester-Gallai Configurations to Rank Bounds: Improved Black-box Identity Test for Depth-3 Circuits. Electron. Colloquium Comput. Complex. TR10 (2010) - [i16]Nitin Saxena, C. Seshadhri:
Blackbox identity testing for bounded top fanin depth-3 circuits: the field doesn't matter. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [j3]Nitin Saxena:
Progress on Polynomial Identity Testing. Bull. EATCS 99: 49-79 (2009) - [c8]Nitin Saxena
An Almost Optimal Rank Bound for Depth-3 Identities. CCC 2009: 137-148 - [c7]Chandan Saha, Ramprasad Saptharishi
The Power of Depth 2 Circuits over Algebras. FSTTCS 2009: 371-382 - [c6]Gábor Ivanyos
Schemes for deterministic polynomial factoring. ISSAC 2009: 191-198 - [i15]Chandan Saha, Ramprasad Saptharishi, Nitin Saxena:
The Power of Depth 2 Circuits over Algebras. CoRR abs/0904.2058 (2009) - [i14]Gábor Ivanyos, Marek Karpinski, Nitin Saxena:
Deterministic Polynomial Time Algorithms for Matrix Completion Problems. CoRR abs/0907.0774 (2009) - [i13]Gábor Ivanyos, Marek Karpinski, Nitin Saxena:
Deterministic Polynomial Time Algorithms for Matrix Completion Problems. Electron. Colloquium Comput. Complex. TR09 (2009) - [i12]Chandan Saha, Ramprasad Saptharishi, Nitin Saxena:
The Power of Depth 2 Circuits over Algebras. Electron. Colloquium Comput. Complex. TR09 (2009) - [i11]Nitin Saxena:
Progress on Polynomial Identity Testing. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [c5]Nitin Saxena
Diagonal Circuit Identity Testing and Lower Bounds. ICALP (1) 2008: 60-71 - [i10]Gábor Ivanyos, Marek Karpinski, Nitin Saxena:
Schemes for Deterministic Polynomial Factoring. CoRR abs/0804.1974 (2008) - [i9]Nitin Saxena, C. Seshadhri:
An Almost Optimal Rank Bound for Depth-3 Identities. CoRR abs/0811.3161 (2008) - [i8]Gábor Ivanyos, Marek Karpinski, Lajos Rónyai, Nitin Saxena:
Trading GRH for algebra: algorithms for factoring polynomials and related structures. CoRR abs/0811.3165 (2008) - [i7]Gábor Ivanyos, Marek Karpinski, Lajos Rónyai, Nitin Saxena:
Trading GRH for algebra: algorithms for factoring polynomials and related structures. Electron. Colloquium Comput. Complex. TR08 (2008) - [i6]Gábor Ivanyos, Marek Karpinski, Nitin Saxena:
Schemes for Deterministic Polynomial Factoring. Electron. Colloquium Comput. Complex. TR08 (2008) - [i5]Nitin Saxena, C. Seshadhri:
An Almost Optimal Rank Bound for Depth-3 Identities. Electron. Colloquium Comput. Complex. TR08 (2008) - 2007
- [j2]Neeraj Kayal, Nitin Saxena
Polynomial Identity Testing for Depth 3 Circuits. Comput. Complex. 16(2): 115-138 (2007) - [i4]Nitin Saxena:
Diagonal Circuit Identity Testing and Lower Bounds. Algebraic Methods in Computational Complexity 2007 - [i3]Nitin Saxena:
Diagonal Circuit Identity Testing and Lower Bounds. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [j1]Neeraj Kayal, Nitin Saxena
Complexity of Ring Morphism Problems. Comput. Complex. 15(4): 342-390 (2006) - [c4]Neeraj Kayal, Nitin Saxena
Polynomial Identity Testing for Depth 3 Circuits. CCC 2006: 9-17 - [c3]Manindra Agrawal, Nitin Saxena
Equivalence of F-Algebras and Cubic Forms. STACS 2006: 115-126 - 2005
- [c2]Neeraj Kayal, Nitin Saxena
On the Ring Isomorphism and Automorphism Problems. CCC 2005: 2-12 - [c1]Manindra Agrawal, Nitin Saxena
Automorphisms of Finite Rings and Applications to Complexity of Problems. STACS 2005: 1-17 - [i2]Neeraj Kayal, Nitin Saxena:
Polynomial Identity Testing for Depth 3 Circuits. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [i1]Neeraj Kayal, Nitin Saxena:
On the Ring Isomorphism & Automorphism Problems. Electron. Colloquium Comput. Complex. TR04 (2004)
Coauthor Index
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-12-09 23:08 CET 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: