default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 457
Volume 457, October 2012
- Vicente Acuña, Etienne Birmelé, Ludovic Cottret
, Pierluigi Crescenzi, Fabien Jourdan, Vincent Lacroix, Alberto Marchetti-Spaccamela, Andrea Marino, Paulo Vieira Milreu, Marie-France Sagot, Leen Stougie:
Telling stories: Enumerating maximal directed acyclic graphs with a constrained set of sources and targets. 1-9 - Jean-Claude Bermond, Joseph G. Peters:
Optimal gathering in radio grids with interference. 10-26 - Dany Breslauer, Giuseppe F. Italiano:
On suffix extensions in suffix trees. 27-34 - Qian Cao, T. C. E. Cheng, Guohua Wan, Yi Li:
Several semi-online scheduling problems on two identical machines with combined information. 35-44 - Marco Comi, Bhaskar DasGupta, Michael Schapira, Venkatakumar Srinivasan:
On communication protocols that compute almost privately. 45-58 - Yotam Elor, Alfred M. Bruckstein:
A "thermodynamic" approach to multi-robot cooperative localization. 59-75 - Yotam Elor, Alfred M. Bruckstein:
Two-robot source seeking with point measurements. 76-85 - Petr A. Golovach, Daniël Paulusma, Jian Song:
Computing vertex-surjective homomorphisms to partially reflexive trees. 86-100 - Daniel Silva Graça, Ning Zhong, H. S. Dumas:
The connection between computability of a nonlinear problem and its linearization: The Hartman-Grobman theorem revisited. 101-110 - Jeffrey Heinz, Anna Kasprzik, Timo Kötzing:
Learning in the limit with lattice-structured hypothesis spaces. 111-127 - Peter M. Higgins:
Burrows-Wheeler transformations and de Bruijn words. 128-136 - Riko Jacob, Stephan Ritscher, Christian Scheideler, Stefan Schmid:
Towards higher-dimensional topological self-stabilization: A distributed algorithm for Delaunay graphs. 137-148 - Alexander Okhotin, Christian Reitwießner:
Parsing Boolean grammars over a one-letter alphabet using online convolution. 149-157 - Weifan Wang, Jiangxu Kong, Lianzhu Zhang:
The 2-surviving rate of planar graphs without 4-cycles. 158-165 - Yu-Mei Xue, Teturo Kamae:
Maximal pattern complexity, dual system and pattern recognition. 166-173 - Junling Yuan, Wenhua Li, Jinjiang Yuan:
A best possible online algorithm for scheduling equal-length jobs on two machines with chain precedence constraints. 174-180
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-10-07 01:06 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:
