Simple Search

Information about Privacy

This website uses Cookies so that we can provide you with the best user experience. We also collect and use personal data. Please see our Privacy Statement. By continuing to use this website you are agreeing to those conditions.

May we evaluate your usage of our website in order to optimize our offer?

Therefore we use Google Analytics. Further information you can find in our Privacy Statement. Your consent is voluntary, you can withdraw it anytime for the future by deleting the cookie GOOGLE_ANALYTICS_INFO.

No connection to the server of the library

The catalogue is currently not accessible. Try again later or contact your library.

Usage of Cookies

Our website needs cookies for a flawless procedure.
A cookie is a small text file which is placed on your computer or device by websites you visit or online services you use.
Below is a short description of cookies used by our application with details of the provider, a short description and their storage duration (if you don't block or delete them). The cookies do not collect personal data.

Necessary Cookies

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

Optional Cookies

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

Cookies of the Administration Section

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

X

Schloss Dagstuhl Library
Search Local Catalogue
eJournals

GO

|

Login

Sprache auswählen

Schloss Dagstuhl Library
Search Local Catalogue
eJournals

|

Login

Sprache auswählen

Simple Search

Search Local Catalogue > Simple Search

Ihre Mediensuche

Permalink

Permalink:

Permalink

Permanent link to this site:

Print result view

Define what should be printed

Current view

All results

Send results as email

Recipient's E-mail address Your name Subject Content

These titles may be interesting to you.

Link to the titles: https://wwwopen.dagstuhl.de/Permalink.aspx?searchhash=OCLC_044fd7fbfc95ec2bf5b781741e55921f598b48bd

Captcha

CAPTCHA image

Enter the code shown above in the box below.

E-Mail

Recipient's E-mail address Your name Subject Content

Captcha

CAPTCHA image

Enter the code shown above in the box below.

Message the library

First name * Last name * E-mail-address * Phone Remark * Captcha

CAPTCHA image

Enter the code shown above in the box below.

Log into your user account.

You must be logged in to reserve items. Would you like to be redirected to the login page?

Log into your user account.

You must be logged in to reserve items. Would you like to be redirected to the login page?

Log into your user account.

You must be logged in to reserve items. Would you like to be redirected to the login page?

Select pickup branch

Choose the branch where you would like to pick up your record.

Branch

Log into your user account.

Provide your password!

Reserve

Enter your e-mail to place the reservation in OverDrive.

E-mail-address

Reserve

Filter further (advanced search)

search filter

Author

limit search to Author

(16)Saranurak, Thatchaphol

(3)Chalermsook, Parinya

(2)Bernstein, Aaron

(2)Gutenberg, Maximilian Probst

(2)Li, Jason -Berkeley, Pittsburgh-

Display more Author-filters

Year

limit search to Year

(3)2026

(5)2025

(3)2024

(1)2023

(2)2022

Display more Year-filters

Publisher

limit search to Publisher

(3)LZI

Media group

limit search to Media group

(13)LIPIcs

(3)DAGSTUHL REPORT

search filter

Author

limit search to Author

(16)Saranurak, Thatchaphol

(3)Chalermsook, Parinya

(2)Bernstein, Aaron

(2)Gutenberg, Maximilian Probst

(2)Li, Jason -Berkeley, Pittsburgh-

Display more Author-filters

Year

limit search to Year

(3)2026

(5)2025

(3)2024

(1)2023

(2)2022

Display more Year-filters

Publisher

limit search to Publisher

(3)LZI

Media group

limit search to Media group

(13)LIPIcs

(3)DAGSTUHL REPORT

Print Permalink Send results as email

Sort by ascending

1 2 next Turn to last page 16 record(s) records per page

search result

Cover von Finding Small Dijoins in Transitive Closure Time

Finding Small Dijoins in Transitive Closure Time

more...

Year: 2025

Parent work: 45th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science

Media group: LIPIcs

Cover von Length-Constrained Directed Expander Decomposition and Length-Constrained Vertex-Capacitated Flow Shortcuts

Length-Constrained Directed Expander Decomposition and Length-Constrained Vertex-Capacitated Flow Shortcuts

more...

Year: 2025

Parent work: 33rd Annual European Symposium on Algorithms

Media group: LIPIcs

Cover von Expander Decomposition with Almost Optimal Overhead

Expander Decomposition with Almost Optimal Overhead

more...

Year: 2026

Parent work: 53rd International Colloquium on Automata, Languages, and Programming

Media group: LIPIcs

Cover von Decremental (1+ε)-Approximate Maximum Eigenvector

Decremental (1+ε)-Approximate Maximum Eigenvector

Dynamic Power Method

more...

Year: 2025

Parent work: 52nd International Colloquium on Automata, Languages, and Programming

Media group: LIPIcs

Cover von Finding Most-Shattering Minimum Vertex Cuts of Polylogarithmic Size in Near-Linear Time

Finding Most-Shattering Minimum Vertex Cuts of Polylogarithmic Size in Near-Linear Time

more...

Year: 2024

Parent work: 51st International Colloquium on Automata, Languages, and Programming

Media group: LIPIcs

Cover von Maximal k-Edge-Connected Subgraphs in Almost-Linear Time for Small k

Maximal k-Edge-Connected Subgraphs in Almost-Linear Time for Small k

more...

Year: 2023

Parent work: 31st Annual European Symposium on Algorithms

Media group: LIPIcs

Cover von Connectivity Oracle Under Vertex Failures by Shortcutting Unbreakable Decomposition

Connectivity Oracle Under Vertex Failures by Shortcutting Unbreakable Decomposition

more...

Year: 2026

Parent work: 53rd International Colloquium on Automata, Languages, and Programming

Media group: LIPIcs

Cover von Pinning down the Strong Wilber 1 Bound for Binary Search Trees

Pinning down the Strong Wilber 1 Bound for Binary Search Trees

more...

Year: 2020

Parent work: Approximation, Randomization, and Combinatorial Optimization

Media group: LIPIcs

Cover von Parallel Reachability and Shortest Paths on Non-Sparse Digraphs

Parallel Reachability and Shortest Paths on Non-Sparse Digraphs

Near-Linear Work and Sub-Square-Root Depth

more...

Year: 2026

Parent work: 53rd International Colloquium on Automata, Languages, and Programming

Media group: LIPIcs

Cover von All-Subsets Important Separators with Applications to Sample Sets, Balanced Separators and Vertex Sparsifiers in Directed Graphs

All-Subsets Important Separators with Applications to Sample Sets, Balanced Separators and Vertex Sparsifiers in Directed Graphs

more...

Year: 2025

Parent work: 52nd International Colloquium on Automata, Languages, and Programming

Media group: LIPIcs

Sort by ascending

1 2 next Turn to last page 16 record(s) records per page

Print Permalink Send results as email

OPEN V 11.1.0.0

No elements for display.

conference
hemodynamical flows
dongarra
thermodynamics
nanosystems
sommer
thermodynamically
somer
tom
system architecture
ai systems
symmetric cryptography
thermodynamic
systems
digital humanism
holger hermanns
31st annual symposium on combinatorial pattern matching
being a researcher
multiobjective optimization
user-aligned assessment of ai systems

Most search terms Search for conference Search for hemodynamical flows Search for dongarra Search for thermodynamics Search for nanosystems Search for sommer Search for thermodynamically Search for somer Search for tom Search for system architecture Search for ai systems Search for symmetric cryptography Search for thermodynamic Search for systems Search for digital humanism Search for holger hermanns Search for 31st annual symposium on combinatorial pattern matching Search for being a researcher Search for multiobjective optimization Search for user-aligned assessment of ai systems

Copyright 2025 by Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH | Privacy Statement | Imprint