Dr Stefan Dantchev s.s.dantchev@durham.ac.uk
Assistant Professor
Sublinear-time algorithms for tournament graphs
Dantchev, Stefan; Friedetzky, Tom; Nagel, Lars
Authors
Dr Tom Friedetzky tom.friedetzky@durham.ac.uk
Associate Professor
Lars Nagel
Citation
Dantchev, S., Friedetzky, T., & Nagel, L. (online). Sublinear-time algorithms for tournament graphs. Journal of Combinatorial Optimization, https://doi.org/10.1007/s10878-010-9325-7
| Journal Article Type | Article |
|---|---|
| Deposit Date | Nov 29, 2012 |
| Journal | Journal of Combinatorial Optimization |
| Print ISSN | 1382-6905 |
| Electronic ISSN | 1573-2886 |
| Publisher | Springer |
| DOI | https://doi.org/10.1007/s10878-010-9325-7 |
| Public URL | https://durham-repository.worktribe.com/output/1470486 |
You might also like
Randomized renaming in shared memory systems
(2021)
Journal Article
Time-space trade-offs in population protocols for the majority problem
(2020)
Journal Article
Self-Stabilizing Balls and Bins in Batches
(2018)
Journal Article
Threshold Load Balancing With Weighted Tasks
(2017)
Journal Article
Downloadable Citations
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search