Zur Kurzanzeige

dc.contributor.author
Bianchi, Maria Paola
dc.contributor.author
Böckenhauer, Hans-Joachim
dc.contributor.author
Hromkovič, Juraj
dc.contributor.author
Krug, Sacha
dc.contributor.author
Steffen, Björn
dc.date.accessioned
2017-08-31T10:18:06Z
dc.date.available
2017-06-14T08:54:12Z
dc.date.available
2017-06-11T13:27:51Z
dc.date.available
2017-08-31T10:18:06Z
dc.date.issued
2014-10-16
dc.identifier.issn
0304-3975
dc.identifier.other
10.1016/j.tcs.2014.06.027
en_US
dc.identifier.uri
http://hdl.handle.net/20.500.11850/182220
dc.identifier.doi
10.3929/ethz-a-010886736
dc.language.iso
en
en_US
dc.publisher
Elsevier
en_US
dc.rights.uri
http://rightsstatements.org/page/InC-NC/1.0/
dc.subject
Online coloring
en_US
dc.subject
Frequency assignment
en_US
dc.subject
Advice complexity
en_US
dc.subject
Randomized algorithms
en_US
dc.title
On the advice complexity of the online L(2,1)-coloring problem on paths and cycles
en_US
dc.type
Journal Article
dc.rights.license
In Copyright - Non-Commercial Use Permitted
dc.date.published
2014-06-26
ethz.journal.title
Theoretical Computer Science
ethz.journal.volume
554
en_US
ethz.journal.abbreviated
Theor. comp. sci.
ethz.pages.start
22
en_US
ethz.pages.end
39
en_US
ethz.version.deposit
submittedVersion
en_US
ethz.code.ddc
0 - Computer science, information & general works::004 - Data processing, computer science
en_US
ethz.grant
Measuring the Information Content of Online Problems
en_US
ethz.identifier.wos
ethz.publication.place
Amsterdam
en_US
ethz.publication.status
published
en_US
ethz.leitzahl
ETH Zürich::00002 - ETH Zürich::00012 - Lehre und Forschung::00007 - Departemente::02150 - Dep. Informatik / Dep. of Computer Science
en_US
ethz.leitzahl
ETH Zürich::00002 - ETH Zürich::00012 - Lehre und Forschung::00007 - Departemente::02150 - Dep. Informatik / Dep. of Computer Science::03666 - Hromkovic, Juraj / Hromkovic, Juraj
en_US
ethz.leitzahl.certified
ETH Zürich::00002 - ETH Zürich::00012 - Lehre und Forschung::00007 - Departemente::02150 - Dep. Informatik / Dep. of Computer Science::03666 - Hromkovic, Juraj / Hromkovic, Juraj
ethz.grant.agreementno
141089
ethz.grant.fundername
SNF
ethz.grant.funderDoi
10.13039/501100001711
ethz.grant.program
Projektförderung in Mathematik, Natur- und Ingenieurwissenschaften (Abteilung II)
ethz.date.deposited
2017-06-11T13:28:09Z
ethz.source
ECOL
ethz.source
ECIT
ethz.identifier.importid
imp59366bb0ab9ed63370
ethz.identifier.importid
imp5936527aadab255947
ethz.ecolpid
eth:50823
ethz.ecitpid
pub:144443
ethz.eth
yes
en_US
ethz.availability
Open access
en_US
ethz.rosetta.installDate
2017-08-31T10:13:33Z
ethz.rosetta.lastUpdated
2019-02-02T11:46:59Z
ethz.rosetta.exportRequired
true
ethz.rosetta.versionExported
true
dc.identifier.olduri
http://hdl.handle.net/20.500.11850/156315
dc.identifier.olduri
http://hdl.handle.net/20.500.11850/91773
ethz.COinS
ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.atitle=On%20the%20advice%20complexity%20of%20the%20online%20L(2,1)-coloring%20problem%20on%20paths%20and%20cycles&rft.jtitle=Theoretical%20Computer%20Science&rft.date=2014-10-16&rft.volume=554&rft.spage=22&rft.epage=39&rft.issn=0304-3975&rft.au=Bianchi,%20Maria%20Paola&B%C3%B6ckenhauer,%20Hans-Joachim&Hromkovi%C4%8D,%20Juraj&Krug,%20Sacha&Steffen,%20Bj%C3%B6rn&rft.genre=article&
 Suchen via SFX

Dateien zu diesem Eintrag

Thumbnail

Publikationstyp

Zur Kurzanzeige