Search research articles
Contact Us
Filters
Showing results (51-60 of 80) with videos related to
Page
of 8
Sort By:
Algorithmica
|
September 23, 2025
ShockHash: Near Optimal-Space Minimal Perfect Hashing Beyond Brute-Force
Hans-Peter Lehmann, Peter Sanders, Stefan Walzer
Algorithmica
|
August 11, 2025
Improved Smoothed Analysis of 2-Opt for the Euclidean TSP
Bodo Manthey, Jesse van Rhijn
Algorithmica
|
December 13, 2024
Limitations of the Impagliazzo-Nisan-Wigderson Pseudorandom Generator Against Permutation Branching Programs
William M Hoza, Edward Pyne, Salil Vadhan
Algorithmica
|
January 8, 2024
Computing Generalized Convolutions Faster Than Brute Force
Barış Can Esmer, Ariel Kulik, Dániel Marx, et al.
Algorithmica
|
March 14, 2024
Perfect Matchings with Crossings
Oswin Aichholzer, Ruy Fabila-Monroy, Philipp Kindermann, et al.
Algorithmica
|
June 26, 2023
Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number
Pranabendu Misra, Saket Saurabh, Roohani Sharma, et al.
Algorithmica
|
April 20, 2026
Parameterized Complexities of Dominating and Independent Set Reconfiguration
Hans L Bodlaender, Carla Groenland, Céline M F Swennenhuis
Algorithmica
|
February 7, 2022
Approximate Minimum Selection with Unreliable Comparisons
Stefano Leucci, Chih-Hung Liu
Algorithmica
|
November 1, 2021
Obtaining a Proportional Allocation by Deleting Items
Britta Dorn, Ronald de Haan, Ildikó Schlotter
Algorithmica
|
November 1, 2021
Scheduling in the Random-Order Model
Susanne Albers, Maximilian Janke
Page
of 8
Search research articles
Search
Showing results (51-60 of 80) with videos related to
Sort By:
Page
of 8
Algorithmica
|
September 23, 2025
ShockHash: Near Optimal-Space Minimal Perfect Hashing Beyond Brute-Force
Hans-Peter Lehmann, Peter Sanders, Stefan Walzer
Algorithmica
|
August 11, 2025
Improved Smoothed Analysis of 2-Opt for the Euclidean TSP
Bodo Manthey, Jesse van Rhijn
Algorithmica
|
December 13, 2024
Limitations of the Impagliazzo-Nisan-Wigderson Pseudorandom Generator Against Permutation Branching Programs
William M Hoza, Edward Pyne, Salil Vadhan
Algorithmica
|
January 8, 2024
Computing Generalized Convolutions Faster Than Brute Force
Barış Can Esmer, Ariel Kulik, Dániel Marx, et al.
Algorithmica
|
March 14, 2024
Perfect Matchings with Crossings
Oswin Aichholzer, Ruy Fabila-Monroy, Philipp Kindermann, et al.
Algorithmica
|
June 26, 2023
Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number
Pranabendu Misra, Saket Saurabh, Roohani Sharma, et al.
Algorithmica
|
April 20, 2026
Parameterized Complexities of Dominating and Independent Set Reconfiguration
Hans L Bodlaender, Carla Groenland, Céline M F Swennenhuis
Algorithmica
|
February 7, 2022
Approximate Minimum Selection with Unreliable Comparisons
Stefano Leucci, Chih-Hung Liu
Algorithmica
|
November 1, 2021
Obtaining a Proportional Allocation by Deleting Items
Britta Dorn, Ronald de Haan, Ildikó Schlotter
Algorithmica
|
November 1, 2021
Scheduling in the Random-Order Model
Susanne Albers, Maximilian Janke
Page
of 8