default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation and Computation, Volume 201
Volume 201, Number 1, 25 August 2005
- Giuseppe Castagna, Jan Vitek, Francesco Zappa Nardelli:
The Seal Calculus. 1-54 - Yuri Kalnishkan
, Vladimir Vovk, Michael V. Vyugin:
How many strings are easy to predict? 55-71 - Mark Reynolds:
An axiomatization of PCTL*. 72-119
Volume 201, Number 2, 15 September 2005
- Venkatesh Choppella, Christopher T. Haynes:
Source-tracking unification. 121-159 - Matthias Krause, Petr Savický, Ingo Wegener:
On the influence of the variable ordering for algorithmic learning using OBDDs. 160-177 - Atsuyoshi Nakamura:
An efficient query learning algorithm for ordered binary decision diagrams. 178-198 - Shigeki Akiyama, Frédérique Bassino, Christiane Frougny:
Arithmetic Meyer sets and finite automata. 199-215 - Jianer Chen, Benny Chor, Mike Fellows, Xiuzhen Huang, David W. Juedes, Iyad A. Kanj, Ge Xia:
Tight lower bounds for certain parameterized NP-hard problems. 216-231
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-11-18 20:51 CET 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:
