Remember Me
Or use your Academic/Social account:


Or use your Academic/Social account:


You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.


Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message


Verify Password:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Dagstuhl Research Online Publication Server
Institutional Repository
6338 Publications
More information
Detailed data provider information (OpenDOAR)


  • A note on the size of Craig Interpolants

    Mundici considered the question of whether the interpolant of two propositional formulas of the form $F ightarrow G$ can always have a short circuit description, and showed that if this is the case then every problem in NP $cap$ co-NP would have polynomial size circuits. In this note we observe further consequences of the interpolant having short circuit descriptions, namely that UP $subseteq$ P$/$poly, and that every single valued NP function has a total extension in...

    Biological Data Visualization (Dagstuhl Seminar 12372)

    The topic of visualizing biological data has recently seen growing interest. Visualization approaches can help researchers understand and analyze today's large and complex biological datasets. The aim of this seminar was to bring together biologists, bioinformaticians, and computer scientists to survey the current state of tools for visualizing biological data and to define a research agenda for developing the next generation of tools. During the seminar, the participants formed working group...

    Uniprocessor EDF Feasibility is an Integer Problem

    The research on real-time scheduling has mostly focused on the development of algorithms that allows to test whether the constraints imposed on the task execution (often expressed by deadlines) are verified or not. However, in many design scenarios the task set is only partially known and these algorithms cannot be applied because they require the complete knowledge of all the parameters of the task set. Moreover, very often the designer has the freedom to s...

    Blockchain-Based Consensus (Keynote)

    Distributed consensus (aka Byzantine agreement [Pease, Shostak & Lamport, 1980]) is one of the fundamental problems in fault-tolerant distributed computing and cryptographic protocols. It requires correct participants (parties) to reach agreement on initially held values despite the arbitrary behavior of some of them, with the additional requirement (known as Validity) that if all the correct participants start off with the same value, then that must be the decision value. The problem has bee...

    On the Notion of Genre in Digital Preservation

    In this paper, we discuss the notion of genre as a basis for addressing the problem of context representation in digital preservation. We outline several reference points for the notion of genre. This includes a review of diplomatic principles that can support and enhance the power of genre as a key to capture information about context relations. Further, we discuss the impact of open genre models and open topic models in information retrieval and finally present a list of research questions ...
  • No data provider research data found
  • Latest Documents Timeline

    Chart is loading... It may take a bit of time. Please be patient and don't reload the page.

    Document Types

    Chart is loading... It may take a bit of time. Please be patient and don't reload the page.

    Funders in data provider publications

    Chart is loading... It may take a bit of time. Please be patient and don't reload the page.

    Projects with most Publications

    Chart is loading... It may take a bit of time. Please be patient and don't reload the page.

Share - Bookmark