UB Paderborn / Katalog / Suche / in CDI

Codes, lower bounds, and phase transitions in the symmetric rendezvous problem

Random structures & algorithms, 2016-12, Vol.49 (4), p.742-765

2016

Volltextzugriff (PDF)

Wake up and join me! An energy-efficient algorithm for maximal matching in radio networks

Distributed computing, 2023-09, Vol.36 (3), p.373-384

2023

Volltextzugriff (PDF)

Local uniformity properties for glauber dynamics on graph colorings

Random structures & algorithms, 2013-09, Vol.43 (2), p.139-180

Hayes, Thomas P.

2013

Volltextzugriff (PDF)

Separating the k-party communication complexity hierarchy: an application of the Zarankiewicz problem

Discrete mathematics and theoretical computer science, 2011-12, Vol.13 no. 4 (4), p.15-22

Hayes, Thomas P.

2011

Volltextzugriff (PDF)

Randomly coloring constant degree graphs

Random structures & algorithms, 2013-09, Vol.43 (2), p.181-200

2013

Volltextzugriff (PDF)

Randomly coloring planar graphs with fewer colors than the maximum degree

Random structures & algorithms, 2015-12, Vol.47 (4), p.731-759

2015

Volltextzugriff (PDF)

The Forgiving Graph: a distributed data structure for low stretch under adversarial attack

Distributed computing, 2012-08, Vol.25 (4), p.261-278

2012

Volltextzugriff (PDF)

Coupling with the Stationary Distribution and Improved Sampling for Colorings and Independent Sets

The Annals of applied probability, 2006-08, Vol.16 (3), p.1297-1318

2006

Volltextzugriff (PDF)

Variable length path coupling

Random structures & algorithms, 2007-10, Vol.31 (3), p.251-272

2007

Volltextzugriff (PDF)

Reconstruction of random geometric graphs: Breaking the Ω(r) distortion barrier

European journal of combinatorics, 2024-10, Vol.121, p.103842, Article 103842

2024

Volltextzugriff (PDF)

Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model

SIAM journal on computing, 2019-01, Vol.48 (2), p.581-643

2019

Volltextzugriff (PDF)

Interactive communication with unknown noise rate

Information and computation, 2018-08, Vol.261, p.464-486

2018

Volltextzugriff (PDF)

Randomly coloring planar graphs with fewer colors than the maximum degree

Annual ACM Symposium on Theory of Computing: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing; 11-13 June 2007, 2007, p.450-458

2007

Volltextzugriff (PDF)

PREDICTING INFORMATION TECHNOLOGY ADOPTION IN SMALL BUSINESSES: AN EXTENSION OF THE TECHNOLOGY ACCEPTANCE MODEL

Academy of Information and Management Sciences journal, 2012-01, Vol.15 (1), p.37

Hayes, Thomas P

2012

Volltextzugriff (PDF)

Robbing the bandit:less regret in online geometric optimization against an adaptive adversary

Symposium on Discrete Algorithms: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm; 22-26 Jan. 2006, 2006, p.937-943

2006

Volltextzugriff (PDF)

Bounds on the diameter of Cayley graphs of the symmetric group

Journal of algebraic combinatorics, 2014-08, Vol.40 (1), p.1-22

2014

Volltextzugriff (PDF)

The adwords problem: online keyword matching with budgeted bidders under random permutations

Proceedings of the 10th ACM conference on Electronic commerce, 2009, p.71-78

2009

Volltextzugriff (PDF)

Distributed metropolis sampler with optimal parallelism

Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2021, p.2121-2140

2021

Volltextzugriff (PDF)

The Energy Complexity of BFS in Radio Networks

Proceedings of the 39th Symposium on Principles of Distributed Computing, 2020, p.273-282

2020

Volltextzugriff (PDF)

The Energy Complexity of Broadcast

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018, p.95-104

2018

Volltextzugriff (PDF)

Online collaborative filtering with nearly optimal dynamic regret

ACM Symposium on Parallel Algorithms and Architectures: Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures; 09-11 June 2007, 2007, p.315-319

2007

Volltextzugriff (PDF)

Near-independence of permutations and an almost sure polynomial bound on the diameter of the symmetric group

Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, 2005, p.1057-1066

2005

Volltextzugriff (PDF)

Brief Announcement: Wake Up and Join Me! An Energy Efficient Algorithm for Maximal Matching in Radio Networks

Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, 2021, p.151-153

2021

Volltextzugriff (PDF)

A simple condition implying rapid mixing of single-site dynamics on spin systems

2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06), 2006, p.39-46

Hayes, T.P.

2006

Volltextzugriff (PDF)

A Scalable Algorithm for Multiparty Interactive Communication with Private Channels

Proceedings of the 21st International Conference on Distributed Computing and Networking, 2020, p.1-15

2020

Volltextzugriff (PDF)

Menü

Weitere Dienste

Einstellungen

Codes, lower bounds, and phase transitions in the symmetric rendezvous problem

Wake up and join me! An energy-efficient algorithm for maximal matching in radio networks

Local uniformity properties for glauber dynamics on graph colorings

Separating the k-party communication complexity hierarchy: an application of the Zarankiewicz problem

Randomly coloring constant degree graphs

Randomly coloring planar graphs with fewer colors than the maximum degree

The Forgiving Graph: a distributed data structure for low stretch under adversarial attack

Coupling with the Stationary Distribution and Improved Sampling for Colorings and Independent Sets

Variable length path coupling

Reconstruction of random geometric graphs: Breaking the Ω(r) distortion barrier

Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model

Interactive communication with unknown noise rate

Randomly coloring planar graphs with fewer colors than the maximum degree

PREDICTING INFORMATION TECHNOLOGY ADOPTION IN SMALL BUSINESSES: AN EXTENSION OF THE TECHNOLOGY ACCEPTANCE MODEL

Robbing the bandit:less regret in online geometric optimization against an adaptive adversary

Bounds on the diameter of Cayley graphs of the symmetric group

The adwords problem: online keyword matching with budgeted bidders under random permutations

Distributed metropolis sampler with optimal parallelism

The Energy Complexity of BFS in Radio Networks

The Energy Complexity of Broadcast

Online collaborative filtering with nearly optimal dynamic regret

Near-independence of permutations and an almost sure polynomial bound on the diameter of the symmetric group

Brief Announcement: Wake Up and Join Me! An Energy Efficient Algorithm for Maximal Matching in Radio Networks

A simple condition implying rapid mixing of single-site dynamics on spin systems

A Scalable Algorithm for Multiparty Interactive Communication with Private Channels

Suchergebnisse filtern