SIGN IN
SIGN UP
Low latency and cheat-proof event ordering for peer-to-peer games
Full Text:
PDF
Buy this Article
Authors:
Chris GauthierDickey
University of Oregon, Eugene, OR
Daniel Zappala
University of Oregon, Eugene, OR
Virginia Lo
University of Oregon, Eugene, OR
James Marr
University of Oregon, Eugene, OR
2004 Article
Bibliometrics
· Downloads (6 Weeks): 6
· Downloads (12 Months): 50
· Downloads (cumulative): 1,157
· Citation Count: 46
Published in:
· Proceeding
NOSSDAV '04 Proceedings of the 14th international workshop on Network and operating systems support for digital audio and video
Pages 134-139
ACM
New York, NY
, USA
©2004
table of contents
ISBN:1-58113-801-6
doi>
10.1145/1005847.1005877
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
cheat-proof
distributed
distributed applications
distributed networks
games
gaming
interactive
low-latency
peer-to-peer
performance
security
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder