default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation and Computation, Volume 233
Volume 233, December 2013
- Unnar Th. Bachmann, Magnús M. Halldórsson
, Hadas Shachnai:
Online selection of intervals and t-intervals. 1-11 - Michael Merritt, Gadi Taubenfeld:
Computing with infinitely many processes. 12-31 - Allyx Fontaine, Yves Métivier, John Michael Robson, Akka Zemmari:
Optimal bit complexity randomised distributed MIS and maximal matching algorithms for anonymous rings. 32-40 - George Barmpalias:
Universal computably enumerable sets and initial segment prefix-free complexity. 41-59 - Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh:
Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs. 60-70
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-12-12 01:27 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:
