Fast algorithms for finding O(congestion+dilation) packet routing schedules.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/hicss/LeightonM95
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/hicss/LeightonM95
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Bruce_M._Maggs
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Frank_Thomson_Leighton
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1109%2FHICSS.1995.375501
>
foaf:
homepage
<
https://doi.org/10.1109/HICSS.1995.375501
>
dc:
identifier
DBLP conf/hicss/LeightonM95
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1109%2FHICSS.1995.375501
(xsd:string)
dcterms:
issued
1995
(xsd:gYear)
rdfs:
label
Fast algorithms for finding O(congestion+dilation) packet routing schedules.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Bruce_M._Maggs
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Frank_Thomson_Leighton
>
swrc:
pages
555-563
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/hicss/1995
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/hicss/LeightonM95/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/hicss/LeightonM95
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/hicss/hicss1995.html#LeightonM95
>
rdfs:
seeAlso
<
https://doi.org/10.1109/HICSS.1995.375501
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/hicss
>
dc:
subject
packet switching; telecommunication network routing; processor scheduling; computational complexity; multiprocessor interconnection networks; parallel algorithms; fast algorithms; congestion; dilation; packet routing schedules; fixed edge-simple paths; constant-size queues; Lovasz local lemma; algorithm parallelization
(xsd:string)
dc:
title
Fast algorithms for finding O(congestion+dilation) packet routing schedules.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document