Professorship Chalermsook Parinya

Search results

  • 2024

    An FPTAS for Connectivity Interdiction

    Huang, C. C., Obscura Acosta, N. & Yingchareonthawornchai, S., 22 May 2024, Integer Programming and Combinatorial Optimization - 25th International Conference, IPCO 2024, Proceedings. Vygen, J. & Byrka, J. (eds.). Springer, p. 210-223 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 14679 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

    Open Access

  • Approximating Sparsest Cut in Low-Treewidth Graphs via Combinatorial Diameter

    Chalermsook, P., Kaul, M., Mnich, M., Spoerhase, J., Uniyal, S. & Vaz, D., 22 Jan 2024, In: ACM Transactions on Algorithms. 20, 1, p. 1-20 6.

    Research output: Contribution to journal › Article › Scientific › peer-review

    Open Access

  • Local Optimization Algorithms for Maximum Planar Subgraph

    Călinescu, G. & Uniyal, S., Sept 2024, 32nd Annual European Symposium on Algorithms, ESA 2024. Chan, T., Fischer, J., Iacono, J. & Herman, G. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 1-18 18 p. 38. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 308).

    Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

    Open Access
    File
    20 Downloads (Pure)

  • On the connectivity interdiction problem, the geometry of data structures and Eulerian circuits

    Obscura Acosta, N., 2024, Aalto University. 202 p.

    Research output: Thesis › Doctoral Thesis › Collection of Articles

    Open Access

  • Parameterized Approximation For Robust Clustering in Discrete Geometric Spaces

    Abbasi, F., Byrka, J., Gadekar, A., Marx, D., Spoerhase, J., Banerjee, S., Chalermsook, P., Khodamoradi, K. & Sharma, R., Jul 2024, 51st International Colloquium on Automata, Languages, and Programming, ICALP 2024. Bringmann, K., Grohe, M., Puppis, G. & Svensson, O. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 6. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 297).

    Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

    Open Access
    File
    3 Citations (Scopus)
    28 Downloads (Pure)

  • Simplicity in Eulerian circuits : Uniqueness and safety

    Obscura Acosta, N. & Tomescu, A. I., Jan 2024, In: Information Processing Letters. 183, p. 1-5 5 p., 106421.

    Research output: Contribution to journal › Article › Scientific › peer-review

    Open Access
    File
    2 Citations (Scopus)
    101 Downloads (Pure)

  • Sorting Pattern-Avoiding Permutations via 0-1 Matrices Forbidding Product Patterns

    Chalermsook, P., Pettie, S. & Yingchareonthawornchai, S., 2024, Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Woodruff, D. P. (ed.). Society for Industrial and Applied Mathematics, p. 133-149 17 p.

    Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

    Open Access
    5 Citations (Scopus)

  • The Group Access Bounds for Binary Search Trees

    Chalermsook, P., Gupta, M., Jiamjitrak, W., Pareek, A. & Yingchareonthawornchai, S., Jul 2024, 51st International Colloquium on Automata, Languages, and Programming, ICALP 2024. Bringmann, K., Grohe, M., Puppis, G. & Svensson, O. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 38. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 297).

    Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

    Open Access
    File
    7 Downloads (Pure)
  • 2023

    Improved Pattern-Avoidance Bounds for Greedy BSTs via Matrix Decomposition

    Chalermsook, P., Gupta, M., Jiamjitrak, W., Acosta, N. O., Pareek, A. & Yingchareonthawornchai, S., 2023, Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Society for Industrial and Applied Mathematics, p. 509-534 26 p.

    Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

    Open Access
    File
    8 Citations (Scopus)
    23 Downloads (Pure)

  • Independent Set in k-Claw-Free Graphs : Conditional X-Boundedness and the Power of LP/SDP Relaxations

    Chalermsook, P., Gadekar, A., Khodamoradi, K. & Spoerhase, J., 2023, Approximation and Online Algorithms - 21st International Workshop, WAOA 2023, Proceedings. Byrka, J. & Wiese, A. (eds.). Springer, p. 205-218 14 p. (Lecture Notes in Computer Science; vol. 14297 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

    Open Access

  • On the Parameterized Complexity of Compact Set Packing

    Gadekar, A., 2023, WALCOM: Algorithms and Computation - 17th International Conference and Workshops, WALCOM 2023, Proceedings. Lin, C.-C., Lin, B. M. & Liotta, G. (eds.). Springer, p. 359-370 12 p. (Lecture Notes in Computer Science; vol. 13973 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

    Open Access

  • Parameterized Approximation: Algorithms and Hardness (Dagstuhl Seminar 23291).

    Karthik, C. S. (Editor), Chalermsook, P. (Editor), Spoerhase, J. (Editor), Zehavi, M. (Editor) & Herold, M. (Editor), 2023, In: Dagstuhl Reports. 13, 7, 12 p.

    Research output: Contribution to journal › Special issue › Scientific › peer-review

    Open Access
    File
    92 Downloads (Pure)

  • Parameterized Approximation Results for Clustering and Graph Packing Problems

    Gadekar, A., 2023, Aalto University. 225 p.

    Research output: Thesis › Doctoral Thesis › Collection of Articles

    Open Access

  • Parameterized Approximation Schemes for Clustering with General Norm Objectives

    Abbasi, F., Banerjee, S., Byrka, J., Chalermsook, P., Gadekar, A., Khodamoradi, K., Marx, D., Sharma, R. & Spoerhase, J., 2023, 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS). IEEE, p. 1377-1399 23 p. 10353074

    Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

    Open Access
    9 Citations (Scopus)

  • Pinning Down the Strong Wilber-1 Bound for Binary Search Trees

    Chalermsook, P., Chuzhoy, J. & Saranurak, T., 19 Dec 2023, In: THEORY OF COMPUTING. 19, 8, p. 1-71 8.

    Research output: Contribution to journal › Article › Scientific › peer-review

    Open Access
    File
    7 Downloads (Pure)

  • Polynomial-Time Approximation of Independent Set Parameterized by Treewidth

    Chalermsook, P., Fomin, F., Hamm, T., Korhonen, T., Nederlof, J. & Orgo, L., Sept 2023, 31st Annual European Symposium on Algorithms, ESA 2023. Li Gortz, I., Farach-Colton, M., Puglisi, S. J. & Herman, G. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 1-13 13 p. 33. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 274).

    Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

    Open Access
    File
    61 Downloads (Pure)

  • Vertex Connectivity via Local Computation: Breaking Quadratic Time, Poly-logarithmic Max-flows, and Derandomization

    Yingchareonthawornchai, S., 2023, Aalto University. 185 p.

    Research output: Thesis › Doctoral Thesis › Collection of Articles

    Open Access
  • 2022

    Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver

    Chalermsook, P., Huang, C. C., Nanongkai, D., Saranurak, T., Sukprasert, P. & Yingchareonthawornchai, S., 1 Jul 2022, 49th EATCS International Conference on Automata, Languages, and Programming, ICALP 2022. Bojanczyk, M., Merelli, E. & Woodruff, D. P. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 1-20 20 p. 37. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 229).

    Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

    Open Access
    File
    1 Citation (Scopus)
    33 Downloads (Pure)

  • Approximation and Online Algorithms : 20th International Workshop, WAOA 2022, Potsdam, Germany, September 8–9, 2022, Proceedings

    Chalermsook, P. & Laekhanukit, B., 2022, Springer. 255 p. (Lecture Notes in Computer Science; vol. 13538)

    Research output: Book/Report › Anthology › Scientific › peer-review

  • Clustering with Fair-Center Representation: Parameterized Approximation Algorithms and Heuristics

    Thejaswi, S., Gadekar, A., Ordozgoiti, B. & Osadnik, M., 14 Aug 2022, KDD 2022 - Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. ACM, p. 1749-1759 11 p.

    Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

    Open Access
    7 Citations (Scopus)

  • Deterministic Small Vertex Connectivity in Almost Linear Time

    Saranurak, T. & Yingchareonthawornchai, S., 30 Oct 2022, Proceedings of 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS). IEEE, p. 789-800 (Annual Symposium on Foundations of Computer Science).

    Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

    Open Access
    File
    3 Citations (Scopus)
    68 Downloads (Pure)

  • Engineering Nearly Linear-Time Algorithms for Small Vertex Connectivity

    Franck, M. & Yingchareonthawornchai, S., 13 Dec 2022, In: ACM Journal of Experimental Algorithmics. 27, p. 1-29 29 p., 4.4.

    Research output: Contribution to journal › Article › Scientific › peer-review

    Open Access
    File
    45 Downloads (Pure)

  • Preface

    Chalermsook, P. & Laekhanukit, B., 2022, In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 13538 LNCS

    Research output: Contribution to journal › Editorial › Scientific › peer-review

  • 2021

    Coloring and maximum weight independent set of rectangles

    Chalermsook, P. & Walczak, B., 2021, ACM-SIAM Symposium on Discrete Algorithms, SODA 2021. Marx, D. (ed.). ACM, p. 860-868 9 p.

    Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

    Open Access
    27 Citations (Scopus)

  • Engineering Nearly Linear-Time Algorithms for Small Vertex Connectivity

    Franck, M. & Yingchareonthawornchai, S., 1 Jun 2021, 19th International Symposium on Experimental Algorithms, SEA 2021. Coudert, D. & Natale, E. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 1:1-1:18 1. (Leibniz International Proceedings in Informatics (LIPIcs); vol. 190).

    Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

    Open Access
    File
    34 Downloads (Pure)

  • On Minimum Generalized Manhattan Connections

    Antoniadis, A., Capretto, M., Chalermsook, P., Damerius, C., Kling, P., Nölke, L., Obscura Acosta, N. & Spoerhase, J., 2021, Algorithms and Data Structures - 17th International Symposium, WADS 2021, Proceedings. Lubiw, A. & Salavatipour, M. (eds.). Springer, p. 85-100 16 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12808 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

    Open Access

  • Precision, recall, and sensitivity of monitoring partially synchronous distributed programs

    Nguyen, D., Yingchareonthawornchai, S., Tekken Valapil, V., Kulkarni, S. S. & Demirbas, M., Oct 2021, In: Distributed Computing. 34, 5, p. 319-348 30 p.

    Research output: Contribution to journal › Article › Scientific › peer-review

    Open Access
    File
    3 Citations (Scopus)
    90 Downloads (Pure)

  • Vertex Connectivity in Poly-Logarithmic Max-Flows

    Li, J., Nanongkai, D., Panigrahi, D., Saranurak, T. & Yingchareonthawornchai, S., 15 Jun 2021, Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing. Khuller, S. & Williams, V. V. (eds.). New York, NY, USA: ACM, p. 317–329 13 p. (STOC 2021).

    Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

    Open Access
    30 Citations (Scopus)

  • Vertex sparsification for edge connectivity

    Chalermsook, P., Das, S., Kook, Y., Laekhanukit, B., Liu, Y. P., Peng, R., Sellke, M. & Vaz, D., 2021, ACM-SIAM Symposium on Discrete Algorithms, SODA 2021. Marx, D. (ed.). ACM, p. 1206-1225 20 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

    Open Access
    21 Citations (Scopus)
  • 2020

    A Simple Primal-Dual Approximation Algorithm for 2-Edge-Connected Spanning Subgraphs

    Beyer, S., Chimani, M. & Spoerhase, J., 1 Jan 2020, Computing and Combinatorics - 26th International Conference, COCOON 2020, Proceedings. Kim, D., Uma, R. N., Cai, Z. & Lee, D. H. (eds.). Springer, p. 347-359 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12273 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

    Open Access

  • Computing and testing small connectivity in near-linear time and queries via fast local cut algorithms

    Forster, S., Nanongkai, D., Yang, L., Saranurak, T. & Yingchareonthawornchai, S., 1 Jan 2020, 31st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2020. Chawla, S. (ed.). ACM, p. 2046-2065 20 p.

    Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

    Open Access
    33 Citations (Scopus)

  • From gap-exponential time hypothesis to fixed parameter tractable inapproximability: Clique, dominating set, and more

    Chalermsook, P., Cygan, M., Kortsarz, G., Laekhanukit, B., Manurangsi, P., Nanongkai, D. & Trevisan, L., 2020, In: SIAM JOURNAL ON COMPUTING. 49, 4, p. 772-810 39 p.

    Research output: Contribution to journal › Article › Scientific › peer-review

    Open Access
    File
    26 Citations (Scopus)
    338 Downloads (Pure)

  • How Many Zeros of a Random Sparse Polynomial Are Real?

    Jindal, G., Pandey, A., Shukla, H. & Zisopoulos, C., 20 Jul 2020, ISSAC 2020 - Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation. Mantzaflaris, A. (ed.). ACM, p. 273-280 8 p.

    Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

    Open Access
    4 Citations (Scopus)

  • Improved learning of k-parities

    Bhattacharyya, A., Gadekar, A. & Rajgopal, N., 6 Nov 2020, In: Theoretical Computer Science. 840, p. 249-256 8 p.

    Research output: Contribution to journal › Article › Scientific › peer-review

    Open Access
    File
    1 Citation (Scopus)
    33 Downloads (Pure)

  • Multi-transversals for Triangles and the Tuza's Conjecture

    Chalermsook, P., Khuller, S., Sukprasert, P. & Uniyal, S., 2020, PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20). Society for Industrial and Applied Mathematics, p. 1955-1974 20 p.

    Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

    Open Access

  • New binary search tree bounds via geometric inversions

    Chalermsook, P. & Jiamjitrak, W. P., 1 Aug 2020, 28th Annual European Symposium on Algorithms, ESA 2020. Grandoni, F., Herman, G. & Sanders, P. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 16 p. 28. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 173).

    Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

    Open Access
    File
    1 Citation (Scopus)
    115 Downloads (Pure)

  • On Finding Balanced Bicliques via Matchings

    Chalermsook, P., Jiamjitrak, W. P. & Orgo, L., 2020, Graph-Theoretic Concepts in Computer Science - 46th International Workshop, WG 2020, Revised Selected Papers. Adler, I. & Müller, H. (eds.). Springer, p. 238-247 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12301 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

    Open Access
    File
    263 Downloads (Pure)

  • Pinning down the strong wilber 1 bound for binary search trees

    Chalermsook, P., Chuzhoy, J. & Saranurak, T., 1 Aug 2020, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020. Byrka, J. & Meka, R. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 21 p. 33. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 176).

    Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

    Open Access
    File
    5 Citations (Scopus)
    46 Downloads (Pure)

  • PTAS for Steiner Tree on Map Graphs

    Byrka, J., Lewandowski, M., Meesum, S. M., Spoerhase, J. & Uniyal, S., 2020, LATIN 2020: Theoretical Informatics - 14th Latin American Symposium 2021, Proceedings. Kohayakawa, Y. & Miyazawa, F. K. (eds.). Springer, p. 3-14 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12118 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

    Open Access

  • Worst-case conditional hardness and fast algorithms with random inputs for non-dominated sorting

    Yingchareonthawornchai, S., Roy, P. C., Laekhanukit, B., Torng, E. & Deb, K., 8 Jul 2020, GECCO 2020 Companion - Proceedings of the 2020 Genetic and Evolutionary Computation Conference Companion. ACM, p. 185-186 2 p.

    Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

    Open Access
    File
    1 Citation (Scopus)
    192 Downloads (Pure)
  • 2019

    A deterministic PTAS for the algebraic rank of bounded degree polynomials

    Bhargava, V., Bläser, M., Jindal, G. & Pandey, A., 1 Jan 2019, Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, p. 647-661 15 p.

    Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

    Open Access
    File
    2 Citations (Scopus)
    125 Downloads (Pure)

  • An optimal O(nm) algorithm for enumerating all walks common to all closed edge-covering walks of a graph

    Cairo, M., Medvedev, P., Acosta, N. O., Rizzi, R. & Tomescu, A. I., 1 Jul 2019, In: ACM Transactions on Algorithms. 15, 4, p. 1-17 48.

    Research output: Contribution to journal › Article › Scientific › peer-review

    Open Access
    10 Citations (Scopus)
    73 Downloads (Pure)

  • A tight approximation for submodular maximization with mixed packing and covering constraints

    Mizrachi, E., Schwartz, R., Spoerhase, J. & Uniyal, S., 1 Jul 2019, 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019). Chatzigiannakis, I., Baier, C., Leonardi, S. & Flocchini, P. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 85. (Leibniz international proceedings in informatics; vol. 132).

    Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

    Open Access
    File
    1 Citation (Scopus)
    56 Downloads (Pure)

  • A Tight Extremal Bound on the Lovász Cactus Number in Planar Graphs

    Chalermsook, P., Schmid, A. & Uniyal, S., 2019, 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 1-14 14 p. 19. (Leibniz international proceedings in informatics; vol. 126).

    Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

    Open Access
    File
    34 Downloads (Pure)

  • Breaking quadratic time for small vertex connectivity and an approximation scheme

    Nanongkai, D., Saranurak, T. & Yingchareonthawornchai, S., 23 Jun 2019, STOC 2019 - Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing. Charikar, M. & Cohen, E. (eds.). ACM, p. 241-252 12 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

    Open Access
    File
    25 Citations (Scopus)
    263 Downloads (Pure)

  • On the complexity of Compact Set r-Packing

    Gadekar, A., 24 Nov 2019, (Submitted).

    Research output: Working paper › Scientific

  • On the complexity of symmetric polynomials

    Bläser, M. & Jindal, G., 1 Jan 2019, 10th Innovations in Theoretical Computer Science, ITCS 2019. Blum, A. (ed.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 1-14 47. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 124).

    Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

    Open Access
    File
    5 Citations (Scopus)
    141 Downloads (Pure)

  • Zip Trees

    Jiamjitrak, W., 2019, (Accepted/In press) In: ACM Transactions on Algorithms.

    Research output: Contribution to journal › Review Article › peer-review

  • 2018

    Approximation schemes for geometric coverage problems

    Chaplick, S., De, M., Ravsky, A. & Spoerhase, J., 1 Aug 2018, In: Leibniz International Proceedings in Informatics. 112, p. 1-15

    Research output: Contribution to journal › Conference article › Scientific › peer-review

    Open Access
    File
    2 Citations (Scopus)
    38 Downloads (Pure)

  • Improved learning of k-parities

    Bhattacharyya, A., Gadekar, A. & Rajgopal, N., 1 Jan 2018, Computing and Combinatorics - 24th International Conference, COCOON 2018, Proceedings. Springer, p. 542-553 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10976 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

    1 Citation (Scopus)