default search action

combined dblp search
author search
venue search
publication search

ask others

Theoretical Computer Science, Volume 500

> Home > Journals > Theoretical Computer Science

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

Volume 500, August 2013

Contributions

- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/EhmsenL13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/EhmsenL13
Martin R. Ehmsen, Kim S. Larsen:
Better bounds on online unit clustering. 1-24
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/MeeksS13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/MeeksS13
Kitty Meeks, Alexander Scott:
The complexity of Free-Flood-It on 2×n boards. 25-43
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/BartalCMN13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/BartalCMN13
Yair Bartal, Douglas E. Carroll, Adam Meyerson, Ofer Neiman:
Bandwidth and low dimensional embedding. 44-56
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/Peltomaki13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/Peltomaki13
Jarkko Peltomäki:
Introducing privileged words: Privileged complexity of Sturmian words. 57-67
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/CsabaPS13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/CsabaPS13
Béla Csaba, Thomas A. Plick, Ali Shokoufandeh:
Optimal random matchings, tours, and spanning trees in hierarchically separated trees. 68-89
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/BlinPR13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/BlinPR13
Lélia Blin, Maria Potop-Butucaru, Stephane Rovedakis:
A super-stabilizing log(n)log(n)-approximation algorithm for dynamic Steiner trees. 90-112

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.