Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 500
Volume 500, August 2013
- Martin R. Ehmsen, Kim S. Larsen
:
Better bounds on online unit clustering. 1-24 - Kitty Meeks, Alexander Scott:
The complexity of Free-Flood-It on 2×n boards. 25-43 - Yair Bartal, Douglas E. Carroll, Adam Meyerson, Ofer Neiman:
Bandwidth and low dimensional embedding. 44-56 - Jarkko Peltomäki:
Introducing privileged words: Privileged complexity of Sturmian words. 57-67 - Béla Csaba, Thomas A. Plick, Ali Shokoufandeh:
Optimal random matchings, tours, and spanning trees in hierarchically separated trees. 68-89 - Lélia Blin, Maria Potop-Butucaru, Stephane Rovedakis:
A super-stabilizing log(n)log(n)-approximation algorithm for dynamic Steiner trees. 90-112
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-19 19:19 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:
