Simple Search

Cookie	Provider	Description	Expires
COPAUTH	OCLC	The cookie stores a successful login.	10 years after creation
EU_LAW_INFO	OCLC	Is set when the user has acknowledged the usage of cookies in OPEN.	10 years after creation
.ASPXANONYMOUS	DNN	The cookie stores an unique ID für anonymous users.	approximately 70 days
.DOTNETNUKE	DNN	A DNN cookie which is created during login.	Session
ASP.NET_SessionId	ASP.NET	Identifies the session of ASP.NET.	Session
authentication	OCLC	Saves the registration way of the patron. DNN (= DNN Login), COP (= OPEN Login) "" (= Patron is not logged in)	Session
dnn_IsMobile	DNN	The cookie stores whether the user uses a mobile device (e.g. a smartphone).	Session
languague	DNN	The cookie stores the currently set language (e.g. de-DE).	Session
LastPageId	DNN	The cookie stores the ID (TabID) of the last visited tab.	Session
__RequestVerificationToken	DNN	The cookie offers protection against cross-site attacks.	Session
SplashPageView	DNN	The cookie controls the single display of the welcome page.	Session
RepeaterCategories, RepeaterGroup	DNNGo	Cookies of the DNN module xPlugin, for layout configuration.	Session

Cookie	Provider	Description	Expires
GOOGLE_ANALYTICS_INFO	OCLC	The cookie is set when the user has acknowledged the usage of the tracking tool Google Analytics.	1 year
_ga, _ga__<container-id>	Google Analytics	The cookie _ga saves the Google Analytics-Client-ID in order to distinguish users, _ga__<container-id> is used to persist session state (provided the user has acknowledged the tool, please refer to cookie GOOGLE_ANALYTICS_INFO).	2 years
_Module_359_Survey_0_, AppearanceSecurityOptions, CSVExportOptions	DNN	These cookies are used by the optional 3rd party DNN module Survey.	until 31.12.9999, 20 minutes, 20 minutes

Cookie	Provider	Description	Expires
List of all settings cookies of OPEN:	OCLC	The cookies control the unfolded/closed - status of the different settings sections as well as the visibility of the headers.	Session
StayInEditMode	DNN	The cookie controls the edit mode of the page.	Session
cem_pending, CEM_CallbackData, CEM_ExistingModule, CEM_NewModuleId	DNN	These cookies are saved when adding or duplicating a module during edit mode.	Session

51st International Colloquium on Automata, Languages, and Programming

ICALP 2024, July 8-12, 2024, Tallinn, Estonia

Year: 2024

Publisher: Wadern, LZI

Series: Leibniz International Proceedings in Informatics; 297

Media group: LIPIcs

Fine-Grained Complexity of Earth Mover’s Distance Under Translation

Year: 2024

Parent work: 40th International Symposium on Computational Geometry

Media group: LIPIcs

The NFA Acceptance Hypothesis

Non-Combinatorial and Dynamic Lower Bounds

Year: 2024

Parent work: 15th Innovations in Theoretical Computer Science Conference

Media group: LIPIcs

Faster Minimization of Tardy Processing Time on a Single Machine

Year: 2020

Parent work: 47th International Colloquium on Automata, Languages, and Programming

Media group: LIPIcs

Scheduling Lower Bounds via AND Subset Sum

Year: 2020

Parent work: 47th International Colloquium on Automata, Languages, and Programming

Media group: LIPIcs

Tree edit distance cannot be computed in strongly subcubic time (unless APSP can)

article in SODA '18 Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms

Year: 2018

Publisher: Philadelphia, SIAM

Media group: ARTICLE

Fine-Grained Complexity of Analyzing Compressed Data

Quantifying Improvements over Decompress-And-Solve : article in FOCS'17 : Proceedings of the 58th Annual IEEE Symposium on Foundations of Computer Science

Year: 2017

Publisher: Los Alamitos, IEEE

Media group: ARTICLE

Maximum Volume Subset Selection for Anchored Boxes

Year: 2017

Parent work: 33rd International Symposium on Computational Geometry

Media group: LIPIcs

Hitting Set for Hypergraphs of Low VC-dimension

Year: 2016

Parent work: 24th Annual European Symposium on Algorithms

Media group: LIPIcs

Parameterized Complexity Dichotomy for Steiner Multicut

Year: 2015

Parent work: 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)

Media group: LIPIcs

OPEN V 11.1.0.0

Simple Search

Author

Year

Publisher

Media group

Author

Year

Publisher

Media group

51st International Colloquium on Automata, Languages, and Programming

Fine-Grained Complexity of Earth Mover’s Distance Under Translation

The NFA Acceptance Hypothesis

Faster Minimization of Tardy Processing Time on a Single Machine

Scheduling Lower Bounds via AND Subset Sum

Tree edit distance cannot be computed in strongly subcubic time (unless APSP can)

Fine-Grained Complexity of Analyzing Compressed Data

Maximum Volume Subset Selection for Anchored Boxes

Hitting Set for Hypergraphs of Low VC-dimension

Parameterized Complexity Dichotomy for Steiner Multicut

Simple Search

search result

51st International Colloquium on Automata, Languages, and Programming

Fine-Grained Complexity of Earth Mover’s Distance Under Translation

The NFA Acceptance Hypothesis

Faster Minimization of Tardy Processing Time on a Single Machine

Scheduling Lower Bounds via AND Subset Sum

Tree edit distance cannot be computed in strongly subcubic time (unless APSP can)

Fine-Grained Complexity of Analyzing Compressed Data

Maximum Volume Subset Selection for Anchored Boxes

Hitting Set for Hypergraphs of Low VC-dimension

Parameterized Complexity Dichotomy for Steiner Multicut