Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation and Computation, Volume 257
Volume 257, December 2017
- Brijesh Dongol
, Robert M. Hierons:
Decidability and complexity for quiescent consistency and its variations. 1-21 - Susanne Albers, Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli, Richard Stotz:
Scheduling on power-heterogeneous processors. 22-33 - Olivier Bournez, Daniel Silva Graça, Amaury Pouly:
On the functions generated by the general purpose analog computer. 34-57 - Yuxin Deng, Yuan Feng:
Probabilistic bisimilarity as testing equivalence. 58-64 - Piotr Skowron:
FPT approximation schemes for maximizing submodular functions. 65-78 - Wan J. Fokkink, Rob J. van Glabbeek:
Divide and congruence II: From decomposition of modal formulas to preservation of delay and weak bisimilarity. 79-113 - Massimo Benerecetti, Marco Faella:
Tracking smooth trajectories in linear hybrid systems. 114-138 - Iyad A. Kanj, Dimitrios M. Thilikos, Ge Xia:
On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability. 139-156
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-25 04:48 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:
