default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation and Computation, Volume 196
Volume 196, Number 1, 10 January 2005
- Stefan Milius:
Completely iterative algebras and completely iterative monads. 1-41 - Tugkan Batu
, Ronitt Rubinfeld, Patrick White:
Fast approximate PCPs for multidimensional bin-packing problems. 42-56 - Zhiyi Tan, Yong He, Leah Epstein:
Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data. 57-70
Volume 196, Number 2, 29 January 2005
- Michele Flammini, Stéphane Pérennes:
Lower bounds on systolic gossip. 71-94 - Irène Durand, Aart Middeldorp:
Decidable call-by-need computations in term rewriting. 95-126 - Luca Cardelli, Giorgio Ghelli, Andrew D. Gordon:
Secrecy and group creation. 127-155
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 2025-04-11 18:16 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:
