Published in: LIPIcs, Volume 264, 38th Computational Complexity Conference (CCC 2023)
Abhibhav Garg, Rafael Oliveira, Shir Peleg, and Akash Kumar Sengupta. Radical Sylvester-Gallai Theorem for Tuples of Quadratics. In 38th Computational Complexity Conference (CCC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 264, pp. 20:1-20:30, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{garg_et_al:LIPIcs.CCC.2023.20, author = {Garg, Abhibhav and Oliveira, Rafael and Peleg, Shir and Sengupta, Akash Kumar}, title = {{Radical Sylvester-Gallai Theorem for Tuples of Quadratics}}, booktitle = {38th Computational Complexity Conference (CCC 2023)}, pages = {20:1--20:30}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-282-2}, ISSN = {1868-8969}, year = {2023}, volume = {264}, editor = {Ta-Shma, Amnon}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2023.20}, URN = {urn:nbn:de:0030-drops-182903}, doi = {10.4230/LIPIcs.CCC.2023.20}, annote = {Keywords: Sylvester-Gallai theorem, arrangements of hypersurfaces, algebraic complexity, polynomial identity testing, algebraic geometry, commutative algebra} }
Published in: LIPIcs, Volume 229, 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)
Akash Kumar, Anand Louis, and Rameesh Paul. Exact Recovery Algorithm for Planted Bipartite Graph in Semi-Random Graphs. In 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 229, pp. 84:1-84:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{kumar_et_al:LIPIcs.ICALP.2022.84, author = {Kumar, Akash and Louis, Anand and Paul, Rameesh}, title = {{Exact Recovery Algorithm for Planted Bipartite Graph in Semi-Random Graphs}}, booktitle = {49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)}, pages = {84:1--84:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-235-8}, ISSN = {1868-8969}, year = {2022}, volume = {229}, editor = {Boja\'{n}czyk, Miko{\l}aj and Merelli, Emanuela and Woodruff, David P.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.84}, URN = {urn:nbn:de:0030-drops-164251}, doi = {10.4230/LIPIcs.ICALP.2022.84}, annote = {Keywords: SDP duality, Planted models, Semi-random models, Exact recovery, Threshold rank, Spectral embedding, Subspace enumeration} }
Published in: LIPIcs, Volume 224, 38th International Symposium on Computational Geometry (SoCG 2022)
Abhibhav Garg, Rafael Oliveira, and Akash Kumar Sengupta. Robust Radical Sylvester-Gallai Theorem for Quadratics. In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 42:1-42:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{garg_et_al:LIPIcs.SoCG.2022.42, author = {Garg, Abhibhav and Oliveira, Rafael and Sengupta, Akash Kumar}, title = {{Robust Radical Sylvester-Gallai Theorem for Quadratics}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {42:1--42:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-227-3}, ISSN = {1868-8969}, year = {2022}, volume = {224}, editor = {Goaoc, Xavier and Kerber, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.42}, URN = {urn:nbn:de:0030-drops-160505}, doi = {10.4230/LIPIcs.SoCG.2022.42}, annote = {Keywords: Sylvester-Gallai theorem, arrangements of hypersurfaces, locally correctable codes, algebraic complexity, polynomial identity testing, algebraic geometry, commutative algebra} }
Published in: LIPIcs, Volume 116, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)
Elena Grigorescu, Akash Kumar, and Karl Wimmer. Flipping out with Many Flips: Hardness of Testing k-Monotonicity. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 116, pp. 40:1-40:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{grigorescu_et_al:LIPIcs.APPROX-RANDOM.2018.40, author = {Grigorescu, Elena and Kumar, Akash and Wimmer, Karl}, title = {{Flipping out with Many Flips: Hardness of Testing k-Monotonicity}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)}, pages = {40:1--40:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-085-9}, ISSN = {1868-8969}, year = {2018}, volume = {116}, editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.40}, URN = {urn:nbn:de:0030-drops-94448}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.40}, annote = {Keywords: Property Testing, Boolean Functions, k-Monotonicity, Lower Bounds} }
Published in: LIPIcs, Volume 93, 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017)
Akash Kumar, Anand Louis, and Madhur Tulsiani. Finding Pseudorandom Colorings of Pseudorandom Graphs. In 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 93, pp. 37:1-37:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{kumar_et_al:LIPIcs.FSTTCS.2017.37, author = {Kumar, Akash and Louis, Anand and Tulsiani, Madhur}, title = {{Finding Pseudorandom Colorings of Pseudorandom Graphs}}, booktitle = {37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017)}, pages = {37:1--37:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-055-2}, ISSN = {1868-8969}, year = {2018}, volume = {93}, editor = {Lokam, Satya and Ramanujam, R.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2017.37}, URN = {urn:nbn:de:0030-drops-83956}, doi = {10.4230/LIPIcs.FSTTCS.2017.37}, annote = {Keywords: Graph Coloring, Expanders, Spectral algorithms} }
Published in: LIPIcs, Volume 67, 8th Innovations in Theoretical Computer Science Conference (ITCS 2017)
Clément L. Canonne, Elena Grigorescu, Siyao Guo, Akash Kumar, and Karl Wimmer. Testing k-Monotonicity. In 8th Innovations in Theoretical Computer Science Conference (ITCS 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 67, pp. 29:1-29:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{canonne_et_al:LIPIcs.ITCS.2017.29, author = {Canonne, Cl\'{e}ment L. and Grigorescu, Elena and Guo, Siyao and Kumar, Akash and Wimmer, Karl}, title = {{Testing k-Monotonicity}}, booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)}, pages = {29:1--29:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-029-3}, ISSN = {1868-8969}, year = {2017}, volume = {67}, editor = {Papadimitriou, Christos H.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.29}, URN = {urn:nbn:de:0030-drops-81583}, doi = {10.4230/LIPIcs.ITCS.2017.29}, annote = {Keywords: Boolean Functions, Learning, Monotonicity, Property Testing} }
Published in: LITES, Volume 4, Issue 2 (2017). Leibniz Transactions on Embedded Systems, Volume 4, Issue 2
Hashan R. Mendis, Neil C. Audsley, and Leandro Soares Indrusiak. Dynamic and Static Task Allocation for Hard Real-Time Video Stream Decoding on NoCs. In LITES, Volume 4, Issue 2 (2017). Leibniz Transactions on Embedded Systems, Volume 4, Issue 2, pp. 01:1-01:25, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@Article{mendis_et_al:LITES-v004-i002-a001, author = {Mendis, Hashan R. and Audsley, Neil C. and Indrusiak, Leandro Soares}, title = {{Dynamic and Static Task Allocation for Hard Real-Time Video Stream Decoding on NoCs}}, booktitle = {LITES, Volume 4, Issue 2 (2017)}, pages = {01:1--01:25}, journal = {Leibniz Transactions on Embedded Systems}, ISSN = {2199-2002}, year = {2017}, volume = {4}, number = {2}, editor = {Mendis, Hashan R. and Audsley, Neil C. and Indrusiak, Leandro Soares}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LITES-v004-i002-a001}, doi = {10.4230/LITES-v004-i002-a001}, annote = {Keywords: Real-time multimedia, Task mapping, Network-on-chip} }
Published in: LIPIcs, Volume 65, 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016)
Aounon Kumar. Capacitated k-Center Problem with Vertex Weights. In 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 65, pp. 8:1-8:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{kumar:LIPIcs.FSTTCS.2016.8, author = {Kumar, Aounon}, title = {{Capacitated k-Center Problem with Vertex Weights}}, booktitle = {36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016)}, pages = {8:1--8:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-027-9}, ISSN = {1868-8969}, year = {2016}, volume = {65}, editor = {Lal, Akash and Akshay, S. and Saurabh, Saket and Sen, Sandeep}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2016.8}, URN = {urn:nbn:de:0030-drops-68438}, doi = {10.4230/LIPIcs.FSTTCS.2016.8}, annote = {Keywords: approximation hardness, k-center, gadget reduction} }
Published in: LIPIcs, Volume 65, 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016)
Mithilesh Kumar and Daniel Lokshtanov. Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Bipartite Tournaments. In 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 65, pp. 24:1-24:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{kumar_et_al:LIPIcs.FSTTCS.2016.24, author = {Kumar, Mithilesh and Lokshtanov, Daniel}, title = {{Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Bipartite Tournaments}}, booktitle = {36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016)}, pages = {24:1--24:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-027-9}, ISSN = {1868-8969}, year = {2016}, volume = {65}, editor = {Lal, Akash and Akshay, S. and Saurabh, Saket and Sen, Sandeep}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2016.24}, URN = {urn:nbn:de:0030-drops-68591}, doi = {10.4230/LIPIcs.FSTTCS.2016.24}, annote = {Keywords: Parameterized algorithms, Exact algorithms, Feedback vertex set, Tour- naments, Bipartite tournaments} }
Published in: LIPIcs, Volume 65, 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016)
Nirman Kumar, Benjamin Raichel, Subhash Suri, and Kevin Verbeek. Most Likely Voronoi Diagrams in Higher Dimensions. In 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 65, pp. 31:1-31:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{kumar_et_al:LIPIcs.FSTTCS.2016.31, author = {Kumar, Nirman and Raichel, Benjamin and Suri, Subhash and Verbeek, Kevin}, title = {{Most Likely Voronoi Diagrams in Higher Dimensions}}, booktitle = {36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016)}, pages = {31:1--31:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-027-9}, ISSN = {1868-8969}, year = {2016}, volume = {65}, editor = {Lal, Akash and Akshay, S. and Saurabh, Saket and Sen, Sandeep}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2016.31}, URN = {urn:nbn:de:0030-drops-68667}, doi = {10.4230/LIPIcs.FSTTCS.2016.31}, annote = {Keywords: Uncertainty, Lower bounds, Voronoi Diagrams, Stochastic} }
Published in: LIPIcs, Volume 65, 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016)
Mrinal Kumar and Ramprasad Saptharishi. Finer Separations Between Shallow Arithmetic Circuits. In 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 65, pp. 38:1-38:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{kumar_et_al:LIPIcs.FSTTCS.2016.38, author = {Kumar, Mrinal and Saptharishi, Ramprasad}, title = {{Finer Separations Between Shallow Arithmetic Circuits}}, booktitle = {36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016)}, pages = {38:1--38:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-027-9}, ISSN = {1868-8969}, year = {2016}, volume = {65}, editor = {Lal, Akash and Akshay, S. and Saurabh, Saket and Sen, Sandeep}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2016.38}, URN = {urn:nbn:de:0030-drops-68730}, doi = {10.4230/LIPIcs.FSTTCS.2016.38}, annote = {Keywords: arithmetic circuits, lower bounds, separations, depth reduction} }
Published in: LIPIcs, Volume 65, 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016)
Ramya C. and B. V. Raghavendra Rao. Sum of Products of Read-Once Formulas. In 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 65, pp. 39:1-39:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{c._et_al:LIPIcs.FSTTCS.2016.39, author = {C., Ramya and Rao, B. V. Raghavendra}, title = {{Sum of Products of Read-Once Formulas}}, booktitle = {36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016)}, pages = {39:1--39:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-027-9}, ISSN = {1868-8969}, year = {2016}, volume = {65}, editor = {Lal, Akash and Akshay, S. and Saurabh, Saket and Sen, Sandeep}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2016.39}, URN = {urn:nbn:de:0030-drops-68741}, doi = {10.4230/LIPIcs.FSTTCS.2016.39}, annote = {Keywords: Arithmetic Circuits, Permanent, Computational Complexity, Algebraic Complexity Theory} }
Published in: LITES, Volume 3, Issue 1 (2016). Leibniz Transactions on Embedded Systems, Volume 3, Issue 1
Matthieu Moy, Claude Helmstetter, Tayeb Bouhadiba, and Florence Maraninchi. Modeling Power Consumption and Temperature in TLM Models. In LITES, Volume 3, Issue 1 (2016). Leibniz Transactions on Embedded Systems, Volume 3, Issue 1, pp. 03:1-03:29, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@Article{moy_et_al:LITES-v003-i001-a003, author = {Moy, Matthieu and Helmstetter, Claude and Bouhadiba, Tayeb and Maraninchi, Florence}, title = {{Modeling Power Consumption and Temperature in TLM Models}}, booktitle = {LITES, Volume 3, Issue 1 (2016)}, pages = {03:1--03:29}, journal = {Leibniz Transactions on Embedded Systems}, ISSN = {2199-2002}, year = {2016}, volume = {3}, number = {1}, editor = {Moy, Matthieu and Helmstetter, Claude and Bouhadiba, Tayeb and Maraninchi, Florence}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LITES-v003-i001-a003}, doi = {10.4230/LITES-v003-i001-a003}, annote = {Keywords: Power consumption, Temperature control, Virtual prototype, SystemC, Transactional modeling} }
Published in: OASIcs, Volume 18, Bringing Theory to Practice: Predictability and Performance in Embedded Systems (2011)
Roel Jordans, Firew Siyoum, Sander Stuijk, Akash Kumar, and Henk Corporaal. An Automated Flow to Map Throughput Constrained Applications to a MPSoC. In Bringing Theory to Practice: Predictability and Performance in Embedded Systems. Open Access Series in Informatics (OASIcs), Volume 18, pp. 47-58, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2011)
@InProceedings{jordans_et_al:OASIcs.PPES.2011.47, author = {Jordans, Roel and Siyoum, Firew and Stuijk, Sander and Kumar, Akash and Corporaal, Henk}, title = {{An Automated Flow to Map Throughput Constrained Applications to a MPSoC}}, booktitle = {Bringing Theory to Practice: Predictability and Performance in Embedded Systems}, pages = {47--58}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-28-6}, ISSN = {2190-6807}, year = {2011}, volume = {18}, editor = {Lucas, Philipp and Wilhelm, Reinhard}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.PPES.2011.47}, URN = {urn:nbn:de:0030-drops-30819}, doi = {10.4230/OASIcs.PPES.2011.47}, annote = {Keywords: design flow automation, multi-processor system-on-chip, throughput constrained, synchronous data-flow graphs} }
Feedback for Dagstuhl Publishing