Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation and Computation, Volume 247
Volume 247, April 2016
- María Isabel González Vasco
, Florian Hess, Rainer Steinwandt:
Combined schemes for signature and encryption: The public-key and the identity-based setting. 1-10 - Rajesh Chitnis, Fedor V. Fomin, Petr A. Golovach:
Parameterized complexity of the anchored k-core problem for directed graphs. 11-22 - Cristian S. Calude, Ludwig Staiger, Frank Stephan:
Finite state incompressible infinite sequences. 23-36 - Luca Bortolussi:
Hybrid behaviour of Markov population models. 37-86 - Manuel Bodirsky, Víctor Dalmau, Barnaby Martin, Antoine Mottet, Michael Pinsker:
Distance constraint satisfaction problems. 87-105 - John Fearnley, Markus N. Rabe, Sven Schewe, Lijun Zhang:
Efficient approximation of optimal control for continuous-time Markov games. 106-129 - Mengqiao Huang, Xiangnan Zhou, Qingguo Li:
Re-visiting axioms of information systems. 130-140 - Yves Métivier, John Michael Robson, Akka Zemmari:
A distributed enumeration algorithm and applications to all pairs shortest paths, diameter... 141-151 - Sanjay Jain, Timo Kötzing, Junqi Ma, Frank Stephan:
On the role of update constraints and text-types in iterative learning. 152-168 - Yael Meller, Orna Grumberg, Sharon Shoham:
A framework for compositional verification of multi-valued systems via abstraction-refinement. 169-202 - Dorit Pardo, Alexander Moshe Rabinovich:
No Future without (a hint of) Past: A Finite Basis for 'Almost Future' Temporal Logic. 203-216 - Lauri Hella, Antti Kuusisto:
Existential second-order logic and modal logic with quantified accessibility relations. 217-234 - Luca Bortolussi, Dimitrios Milios, Guido Sanguinetti:
Smoothed model checking for uncertain Continuous-Time Markov Chains. 235-253 - Emanuele G. Fusco, Andrzej Pelc, Rossella Petreschi:
Topology recognition with advice. 254-265 - Johannes Köbler, Sebastian Kuhnert, Oleg Verbitsky:
On the isomorphism problem for Helly circular-arc graphs. 266-277 - Sang-Ki Ko, Yo-Sub Han, Kai Salomaa:
Approximate matching between a context-free grammar and a finite-state automaton. 278-289 - Giorgi Japaridze:
Introduction to clarithmetic II. 290-312
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-22 21:04 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
