ICALP 2020

Q/A Slot D2 — ICALP-A

Sep 23, 2020

|

28 views

Saarland Informatics Campus

Details

THU, 09.07.2020, 17:00-18:00 UTC+2 Papers: • Parameterized inapproximability for Steiner Orientation by gap amplification • Space Efficient Construction of Lyndon Arrays in Linear Time • The Power of Many Samples in Query Complexity • Towards Optimal Set-Disjointness and Set-Intersection Data Structures • Faster Dynamic Range Mode • Dynamic Longest Common Substring in Polylogarithmic Time

Category: ICALP 2020

Comments

loading...

Reactions (0) | Note

📝 No reactions yet

Be the first one to share your thoughts!

Reactions(0)

Note

loading...

Recommended

ICAPS 2014: Truong-Huy Dinh Nguyen on "Bootstrapping Simulation-Based Algorithms..."

ICAPS | Aug 5, 2014

ICAPS 2014: Peter Stone on "TEXPLORE: Real-Time Sample-Efficient Reinforcement Learning for Robots"

ICAPS | Aug 6, 2014

ICAPS 2014: Ron Alford on "On the Feasibility of Planning Graph Style Heuristics for HTN Planning"

ICAPS | Aug 6, 2014

ICAPS 2014: Mike Barley on "Overcoming the Utility Problem in Heuristic Generation: ..."

ICAPS | Aug 7, 2014

ICAPS 2014: Stefan Edelkamp on "Symbolic and Explicit Search Hybrid through Perfect Hash Functions"

ICAPS | Aug 7, 2014