Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
26
click to vote
STOC
1995
ACM
favorite
Email
discuss
report
118
views
Algorithms
»
more
STOC 1995
»
On randomized one-round communication complexity
14 years 2 months ago
Download
faculty-gsb.stanford.edu
Ilan Kremer, Noam Nisan, Dana Ron
Real-time Traffic
Algorithms
|
STOC 1995
|
claim paper
Related Content
»
Primality Proving via One Round in ECPP and One Iteration in AKS
»
OneRound Protocols for TwoParty Authenticated Key Exchange
»
Adding a referee to an interconnection network What cannot be computed in one round
»
Quantum OneWay Communication is Exponentially Stronger Than Classical Communication
»
Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs
»
Randomized versus Nondeterministic Communication Complexity
»
Lower Bounds on the Randomized Communication Complexity of ReadOnce Functions
»
On the bit communication complexity of randomized rumor spreading
»
Separating Deterministic from Randomized Multiparty Communication Complexity
more »
Post Info
More Details (n/a)
Added
26 Aug 2010
Updated
26 Aug 2010
Type
Conference
Year
1995
Where
STOC
Authors
Ilan Kremer, Noam Nisan, Dana Ron
Comments
(0)
Researcher Info
Algorithms Study Group
Computer Vision