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

A Complexity Trichotomy for Approximately Counting List H-Colourings

Year: 2016

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

Media group: LIPIcs

Amplifiers for the Moran Process

Year: 2016

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

Media group: LIPIcs

Minimum Cost Flows in Graphs with Unit Capacities

Year: 2015

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

Media group: LIPIcs

Absorption Time of the Moran Process

Year: 2014

Parent work: Approximation, Randomization, and Combinatorial Optimization

Media group: LIPIcs

Computational Counting; 1

pp. 47-66

Year: 2013

Publisher: Wadern, LZI

Parent work: Dagstuhl Reports

Count: 1

Media group: DAGSTUHL REPORT

Log-supermodular functions, functional clones and counting CSPs

Year: 2012

Parent work: 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)

Media group: ARTICLE

Approximation, Randomization, and Combinatorial Optimization

Algorithms and Techniques : 14th International Workshop, APPROX 2011, and 15th International Workshop, RANDOM 2011, Princeton, NJ, USA, August 17 - 19, 2011, Proceedings

Year: 2011

Publisher: Berlin, Springer

Series: Lecture notes in computer science; 6845

Media group: MONOGRAPHIE

The Complexity of Approximating Bounded-Degree Boolean #CSP

Year: 2010

Parent work: 27th International Symposium on Theoretical Aspects of Computer Science

Media group: ARTICLE

A Complexity Dichotomy for Partition Functions with Mixed Signs

Year: 2009

Parent work: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science

Media group: ARTICLE

Computational Counting

Year: 2010

Publisher: Wadern, LZI

Series: Dagstuhl Seminar Proceedings; 10481

Media group: DAGSTUHL-SEMINAR-PRO

OPEN V 11.1.0.0

Simple Search

Author

Year

Publisher

Media group

Author

Year

Publisher

Media group

A Complexity Trichotomy for Approximately Counting List H-Colourings

Amplifiers for the Moran Process

Minimum Cost Flows in Graphs with Unit Capacities

Absorption Time of the Moran Process

Computational Counting; 1

Log-supermodular functions, functional clones and counting CSPs

Approximation, Randomization, and Combinatorial Optimization

The Complexity of Approximating Bounded-Degree Boolean #CSP

A Complexity Dichotomy for Partition Functions with Mixed Signs

Computational Counting

Simple Search

search result

A Complexity Trichotomy for Approximately Counting List H-Colourings

Amplifiers for the Moran Process

Minimum Cost Flows in Graphs with Unit Capacities

Absorption Time of the Moran Process

Computational Counting; 1

Log-supermodular functions, functional clones and counting CSPs

Approximation, Randomization, and Combinatorial Optimization

The Complexity of Approximating Bounded-Degree Boolean #CSP

A Complexity Dichotomy for Partition Functions with Mixed Signs

Computational Counting