| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Jakob Bæk Tejs Houen, Mikkel Thorup |
A Sparse Johnson-Lindenstrauss Transform Using Fast Hashing.  |
ICALP  |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Xiantao Li, Chunhao Wang |
Simulating Markovian Open Quantum Systems Using Higher-Order Series Expansion. |
ICALP |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Siddharth Barman, Pooja Kulkarni |
Approximation Algorithms for Envy-Free Cake Division with Connected Pieces. |
ICALP |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | George Kenison, Joris Nieuwveld, Joël Ouaknine, James Worrell 0001 |
Positivity Problems for Reversible Linear Recurrence Sequences. |
ICALP |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikolaj Bojanczyk, Lê Thành Dung Nguyên |
Algebraic Recognition of Regular Functions. |
ICALP |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Jun-Ting Hsieh, Pravesh K. Kothari, Aaron Potechin, Jeff Xu |
Ellipsoid Fitting up to a Constant. |
ICALP |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Bodirsky, Simon Knäuer |
Network Satisfaction Problems Solved by k-Consistency. |
ICALP |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Or Zamir |
The Wrong Direction of Jensen's Inequality Is Algorithmically Right. |
ICALP |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Therese Biedl, Karthik Murali |
On Computing the Vertex Connectivity of 1-Plane Graphs. |
ICALP |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Samuel Braunfeld, Anuj Dawar, Ioannis Eleftheriadis, Aris Papadopoulos |
Monadic NIP in Monotone Classes of Relational Structures. |
ICALP |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Charilaos Efthymiou 0001, Kostas Zampetakis |
Broadcasting with Random Matrices. |
ICALP |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Marvin Künnemann, Filip Mazowiecki, Lia Schütze, Henry Sinclair-Banks, Karol Wegrzycki |
Coverability in VASS Revisited: Improving Rackoff's Bound to Obtain Conditional Optimality. |
ICALP |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich 0001, Simon Krogmann, Martin Schirneck |
Fault-Tolerant ST-Diameter Oracles. |
ICALP |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Antonio Casares, Pierre Ohlmann |
Characterising Memory in Infinite Games. |
ICALP |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Dylan Hyatt-Denesik, Afrouz Jabal Ameli, Laura Sanità |
Finding Almost Tight Witness Trees. |
ICALP |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Laure Morelle, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos |
Faster Parameterized Algorithms for Modification Problems to Minor-Closed Classes. |
ICALP |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Pascal Baumann 0001, Moses Ganardi, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche |
Context-Bounded Analysis of Concurrent Programs (Invited Talk). |
ICALP |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Michal Feldman, Federico Fusco, Simon Mauras, Rebecca Reiffenhäuser |
Truthful Matching with Online Items and Offline Agents. |
ICALP |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Petra Berenbrink, Lukas Hintze, Hamed Hosseinpour, Dominik Kaaser, Malin Rau |
Dynamic Averaging Load Balancing on Arbitrary Graphs. |
ICALP |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Carla Groenland, Michal Pilipczuk |
Parameterized Complexity of Binary CSP: Vertex Cover, Treedepth, and Related Parameters. |
ICALP |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Amirreza Akbari, Navid Eslami, Henrik Lievonen, Darya Melnyk, Joona Särkijärvi, Jukka Suomela |
Locality in Online, Dynamic, Sequential, and Distributed Graph Algorithms. |
ICALP |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Omer Cohen Sidon, Dana Ron |
Sample-Based Distance-Approximation for Subsequence-Freeness. |
ICALP |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Adam Karczmarz, Piotr Sankowski |
Fully Dynamic Shortest Paths and Reachability in Sparse Digraphs. |
ICALP |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi 0001, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki |
Rerouting Planar Curves and Disjoint Paths. |
ICALP |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Sam Coy, Artur Czumaj, Peter Davies, Gopinath Mishra |
Optimal (Degree+1)-Coloring in Congested Clique. |
ICALP |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Yanlin Chen 0001, Ronald de Wolf |
Quantum Algorithms and Lower Bounds for Linear Regression with Norm Constraints. |
ICALP |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Louis Esperet, Nathaniel Harms, Viktor Zamaraev |
Optimal Adjacency Labels for Subgraphs of Cartesian Products. |
ICALP |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Chris Cade, Marten Folkertsma, Sevag Gharibian, Ryu Hayakawa, François Le Gall, Tomoyuki Morimae, Jordi Weggemans |
Improved Hardness Results for the Guided Local Hamiltonian Problem. |
ICALP |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Thiago Bergamaschi |
Improved Product-State Approximation Algorithms for Quantum Local Hamiltonians. |
ICALP |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Charilaos Efthymiou 0001, Weiming Feng 0001 |
On the Mixing Time of Glauber Dynamics for the Hard-Core and Related Models on G(n, d/n). |
ICALP |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Aram Berendsohn, Ishay Golinsky, Haim Kaplan, László Kozma 0002 |
Fast Approximation of Search Trees on Trees with Centroid Trees. |
ICALP |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Anna R. Karlin |
A (Slightly) Improved Approximation Algorithm for the Metric Traveling Salesperson Problem (Invited Talk). |
ICALP |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | TsunMing Cheung, Hamed Hatami, Pooya Hatami, Kaave Hosseini |
Online Learning and Disambiguations of Partial Concept Classes. |
ICALP |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Lohrey, Andreas Rosowski |
On the Complexity of Diameter and Related Problems in Permutation Groups. |
ICALP |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Resch, Chen Yuan 0003, Yihan Zhang 0001 |
Zero-Rate Thresholds and New Capacity Bounds for List-Decoding and List-Recovery. |
ICALP |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Talya Eden, Quanquan C. Liu, Sofya Raskhodnikova, Adam D. Smith |
Triangle Counting with Local Edge Differential Privacy. |
ICALP |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Benedikt, Dmitry Chistikov 0001, Alessio Mansutti |
The Complexity of Presburger Arithmetic with Power or Powers. |
ICALP |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Konstantina Mellou, Marco Molinaro 0001, Rudy Zhou |
Online Demand Scheduling with Failovers. |
ICALP |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Hadley Black, Iden Kalemaj, Sofya Raskhodnikova |
Isoperimetric Inequalities for Real-Valued Functions with Applications to Monotonicity Testing. |
ICALP |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Jansen, Arindam Khan 0001, Marvin Lira, K. V. N. Sreenivas |
A PTAS for Packing Hypercubes into a Knapsack. |
ICALP |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Grohe, Gaurav Rattan, Tim Seppelt |
Homomorphism Tensors and Linear Equations. |
ICALP |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Luyining Gan, Jie Han 0002 |
The Decision Problem for Perfect Matchings in Dense Hypergraphs. |
ICALP |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang 0002 |
Counting and Enumerating Optimum Cut Sets for Hypergraph k-Partitioning Problems for Fixed k. |
ICALP |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Pawel M. Idziak, Piotr Kawalek, Jacek Krzaczkowski, Armin Weiß |
Satisfiability Problems for Finite Groups. |
ICALP |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeremiah Blocki, Elena Grigorescu, Tamalika Mukherjee |
Privately Estimating Graph Parameters in Sublinear Time. |
ICALP |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Ryder Chen, Jahanvi Khatkar, Seeun William Umboh |
Online Weighted Cardinality Joint Replenishment Problem with Delay. |
ICALP |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Arijit Ghosh, Gopinath Mishra, Rahul Raychaudhury, Sayantan Sen |
Tolerant Bipartiteness Testing in Dense Graphs. |
ICALP |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Enguerrand Prebet |
Functions and References in the Pi-Calculus: Full Abstraction and Proof Techniques. |
ICALP |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Sandra Kiefer, Daniel Neuen |
A Study of Weisfeiler-Leman Colorings on Planar Graphs. |
ICALP |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Shimon Kogan, Merav Parter |
Beating Matrix Multiplication for n^{1/3}-Directed Shortcuts. |
ICALP |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | David Caballero, Timothy Gomez, Robert T. Schweller, Tim Wylie |
Unique Assembly Verification in Two-Handed Self-Assembly. |
ICALP |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Gil Cohen, Tal Yankovitz |
LCC and LDC: Tailor-Made Distance Amplification and a Refined Separation. |
ICALP |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Donald M. Stull |
The Dimension Spectrum Conjecture for Planar Lines. |
ICALP |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Sourav Chakraborty 0001, Chandrima Kayal, Manaswi Paraashar |
Separations Between Combinatorial Measures for Transitive Functions. |
ICALP |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Galanis, Daniel Stefankovic, Eric Vigoda |
Approximating Observables Is as Hard as Counting. |
ICALP |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Constantinos Daskalakis |
Equilibrium Computation, Deep Learning, and Multi-Agent Reinforcement Learning (Invited Talk). |
ICALP |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar 0002, Meirav Zehavi |
(Re)packing Equal Disks into Rectangle. |
ICALP |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Gaëtan Douéneau-Tabot |
Hiding Pebbles When the Output Alphabet Is Unary. |
ICALP |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Chao Liao, Qingyun Chen, Bundit Laekhanukit, Yuhao Zhang 0001 |
Almost Tight Approximation Hardness for Single-Source Directed k-Edge-Connectivity. |
ICALP |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Shunhua Jiang, Bento Natura, Omri Weinstein |
A Faster Interior-Point Method for Sum-Of-Squares Optimization. |
ICALP |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Léo Exibard, Emmanuel Filiot, Ayrat Khalimov 0001 |
A Generic Solution to Register-Bounded Synthesis with an Application to Discrete Orders. |
ICALP |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Niel de Beaudrap, Aleks Kissinger, John van de Wetering |
Circuit Extraction for ZX-Diagrams Can Be #P-Hard. |
ICALP |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Nathaniel Harms, Yuichi Yoshida |
Downsampling for Testing and Learning in Product Distributions. |
ICALP |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Arindam Khan 0001, Aditya Lonkar, Arnab Maiti, Amatya Sharma, Andreas Wiese |
Tight Approximation Algorithms for Two-Dimensional Guillotine Strip Packing. |
ICALP |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Michal Pilipczuk, Nicole Schirrmacher, Sebastian Siebertz, Szymon Torunczyk, Alexandre Vigny |
Algorithms and Data Structures for First-Order Logic with Connectivity Under Vertex Failures. |
ICALP |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Todd Schmid, Wojciech Rozowski, Alexandra Silva 0001, Jurriaan Rot |
Processes Parametrised by an Algebraic Theory. |
ICALP |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Amulya Musipatla, Ryan O'Donnell, Tselil Schramm, Xinyu Wu |
The SDP Value of Random 2CSPs. |
ICALP |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Resch, Chen Yuan 0003 |
Threshold Rates of Code Ensembles: Linear Is Best. |
ICALP |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Elahe Ghasemi, Vincent Jugé, Ghazal Khalighinejad |
Galloping in Fast-Growth Natural Merge Sorts. |
ICALP |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich 0001, Martin Schirneck |
Deterministic Sensitivity Oracles for Diameter, Eccentricities and All Pairs Distances. |
ICALP |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Jakob Bæk Tejs Houen, Mikkel Thorup |
Understanding the Moments of Tabulation Hashing via Chaoses. |
ICALP |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Omri Ben-Eliezer, Shoham Letzter, Erik Waingarten |
Finding Monotone Patterns in Sublinear Time, Adaptively. |
ICALP |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphan Thomassé |
A Brief Tour in Twin-Width (Invited Talk). |
ICALP |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Jakob Piribauer, Ocan Sankur, Christel Baier |
The Variance-Penalized Stochastic Shortest Path Problem. |
ICALP |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Nathalie Bertrand 0001, Nicolas Markey, Ocan Sankur, Nicolas Waldburger |
Parameterized Safety Verification of Round-Based Shared-Memory Systems. |
ICALP |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Antonio Casares, Thomas Colcombet, Karoliina Lehtinen |
On the Size of Good-For-Games Rabin Automata and Its Link with the Memory in Muller Games. |
ICALP |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Tamio-Vesa Nakajima, Stanislav Zivný |
Linearly Ordered Colourings of Hypergraphs. |
ICALP |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Ziyun Huang, Jinhui Xu 0001 |
In-Range Farthest Point Queries and Related Problem in High Dimensions. |
ICALP |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Aleksander B. G. Christiansen, Eva Rotenberg |
Fully-Dynamic α + 2 Arboricity Decompositions and Implicit Colouring. |
ICALP |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Bingkai Lin, Xuandi Ren, Yican Sun, Xiuhan Wang |
On Lower Bounds of Approximating Parameterized k-Clique. |
ICALP |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Penghui Yao, Yitong Yin, Xinyuan Zhang |
Polynomial-Time Approximation of Zero-Free Partition Functions. |
ICALP |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnab Ganguly 0002, Rahul Shah 0001, Sharma V. Thankachan |
Fully Functional Parameterized Suffix Trees in Compact Space. |
ICALP |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Moran Feldman, Paul Liu 0001, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen |
Streaming Submodular Maximization Under Matroid Constraints. |
ICALP |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Sebastian Forster, Tijn de Vos |
Faster Cut Sparsification of Weighted Graphs. |
ICALP |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Aviad Rubinstein, Junyao Zhao 0001 |
Maximizing Non-Monotone Submodular Functions over Small Subsets: Beyond 1/2-Approximation. |
ICALP |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Shyam Dhamapurkar, Shubham Vivek Pawar, Jaikumar Radhakrishnan |
Set Membership with Two Classical and Quantum Bit Probes. |
ICALP |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Surender Baswana, Koustav Bhanja, Abhyuday Pandey |
Minimum+1 (s, t)-cuts and Dual Edge Sensitivity Oracle. |
ICALP |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Jakub Tetek |
Approximate Triangle Counting via Sampling and Fast Matrix Multiplication. |
ICALP |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Aaron Berger, William Kuszmaul, Adam Polak 0001, Jonathan Tidor, Nicole Wein |
Memoryless Worker-Task Assignment with Polylogarithmic Switching Cost. |
ICALP |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Charilaos Efthymiou 0001 |
On Sampling Symmetric Gibbs Distributions on Sparse Random Graphs and Hypergraphs. |
ICALP |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Arun Jambulapati, Yujia Jin, Aaron Sidford, Kevin Tian |
Regularized Box-Simplex Games and Dynamic Decremental Bipartite Matching. |
ICALP |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Sepehr Assadi, Aaron Bernstein, Aditi Dudeja |
Decremental Matching in General Graphs. |
ICALP |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil Bansal 0001, Haotian Jiang, Raghu Meka, Sahil Singla 0001, Makrand Sinha |
Smoothed Analysis of the Komlós Conjecture. |
ICALP |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Karl Bringmann, Alejandro Cassis, Nick Fischer, Marvin Künnemann |
A Structural Investigation of the Approximability of Polynomial-Time Problems. |
ICALP |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Jacobus Conradi, Anne Driemel |
On Computing the k-Shortcut Fréchet Distance. |
ICALP |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Mika Göös, Stefan Kiefer, Weiqiang Yuan 0002 |
Lower Bounds for Unambiguous Automata via Communication Complexity. |
ICALP |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Aaron Bernstein, Jan van den Brand, Maximilian Probst Gutenberg, Danupon Nanongkai, Thatchaphol Saranurak, Aaron Sidford, He Sun 0001 |
Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary. |
ICALP |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Tianyi Zhang |
Faster Cut-Equivalent Trees in Simple Graphs. |
ICALP |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Mingyang Deng, Yael Kirkpatrick, Victor Rong, Virginia Vassilevska Williams, Ziqian Zhong |
New Additive Approximations for Shortest Paths and Cycles. |
ICALP |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov |
The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width. |
ICALP |
2022 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license