Oliver Korten

22 papers A* 4A 3C 1Journal 14
YearRankTypeTitle / Venue / Authors
2025 A conf
How to Construct Random Strings.
CCC
Oliver Korten, Rahul Santhanam
2025 J jnl
How to Construct Random Strings.
Electron. Colloquium Comput. Complex.
Oliver Korten, Rahul Santhanam
2025 J jnl
Range Avoidance and the Complexity of Explicit Constructions.
Bull. EATCS
Oliver Korten
2025 A* conf
Stronger Cell Probe Lower Bounds via Local PRGs.
FOCS
Oliver Korten, Toniann Pitassi, Russell Impagliazzo
2025 J jnl
Stronger Cell Probe Lower Bounds via Local PRGs.
Electron. Colloquium Comput. Complex.
Oliver Korten, Toniann Pitassi, Russell Impagliazzo
2024 A* conf
Strong vs. Weak Range Avoidance and the Linear Ordering Principle.
FOCS
Oliver Korten, Toniann Pitassi
2024 J jnl
Strong vs. Weak Range Avoidance and the Linear Ordering Principle.
Electron. Colloquium Comput. Complex.
Oliver Korten, Toniann Pitassi
2023 J jnl
Reconfiguration of connected graph partitions.
J. Graph Theory
Hugo A. Akitaya, Matthew D. Jones, Matias Korman, Oliver Korten, Christopher Meierfrankenfeld, Michael J. Munje, Diane L. Souvaine, Michael Thramann, Csaba D. Tóth
2022 J jnl
Circumscribing Polygons and Polygonizations for Disjoint Line Segments.
Discret. Comput. Geom.
Hugo A. Akitaya, Matias Korman, Oliver Korten, Mikhail Rudoy, Diane L. Souvaine, Csaba D. Tóth
2022 A conf
Derandomization from Time-Space Tradeoffs.
CCC
Oliver Korten
2022 J jnl
Efficient Low-Space Simulations From the Failure of the Weak Pigeonhole Principle.
Electron. Colloquium Comput. Complex.
Oliver Korten
2022 J jnl
Reconfiguration of connected graph partitions via recombination.
Theor. Comput. Sci.
Hugo A. Akitaya, Matias Korman, Oliver Korten, Diane L. Souvaine, Csaba D. Tóth
2021 A* conf
Characterizing Universal Reconfigurability of Modular Pivoting Robots.
SoCG
Hugo A. Akitaya, Erik D. Demaine, Andrei Gonczi, Dylan H. Hendrickson, Adam Hesterberg, Matias Korman, Oliver Korten, Jayson Lynch, Irene Parada, Vera Sacristán
2021 C conf
Reconfiguration of Connected Graph Partitions via Recombination.
CIAC
Hugo A. Akitaya, Matias Korman, Oliver Korten, Diane L. Souvaine, Csaba D. Tóth
2021 A* conf
The Hardest Explicit Construction.
FOCS
Oliver Korten
2021 J jnl
The Hardest Explicit Construction.
CoRR
Oliver Korten
2021 A conf
Total Functions in the Polynomial Hierarchy.
ITCS
Robert Kleinberg, Oliver Korten, Daniel Mitropolsky, Christos H. Papadimitriou
2020 J jnl
Characterizing Universal Reconfigurability of Modular Pivoting Robots.
CoRR
Hugo A. Akitaya, Erik D. Demaine, Andrei Gonczi, Dylan H. Hendrickson, Adam Hesterberg, Matias Korman, Oliver Korten, Jayson Lynch, Irene Parada, Vera Sacristán
2020 J jnl
Edge Matching with Inequalities, Triangles, Unknown Shape, and Two Players.
CoRR
Jeffrey Bosboom, Charlotte Chen, Lily Chung, Spencer Compton, Michael J. Coulombe, Erik D. Demaine, Martin L. Demaine, Ivan Tadeu Ferreira Antunes Filho, Dylan H. Hendrickson, Adam Hesterberg, Calvin Hsu, William Hu, Oliver Korten, Zhezheng Luo, Lillian Zhang
2020 J jnl
Edge Matching with Inequalities, Triangles, Unknown Shape, and Two Players.
J. Inf. Process.
Jeffrey Bosboom, Charlotte Chen, Lily Chung, Spencer Compton, Michael J. Coulombe, Erik D. Demaine, Martin L. Demaine, Ivan Tadeu Ferreira Antunes Filho, Dylan H. Hendrickson, Adam Hesterberg, Calvin Hsu, William Hu, Oliver Korten, Zhezheng Luo, Lillian Zhang
2020 J jnl
Reconfiguration of Connected Graph Partitions via Recombination.
CoRR
Hugo A. Akitaya, Matias Korman, Oliver Korten, Diane L. Souvaine, Csaba D. Tóth
2019 J jnl
On the Complexity of 2-Player Packing Games.
CoRR
Oliver Korten