Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

161

COCO
2000
Springer

125views Algorithms» more COCO 2000»

The Communication Complexity of Enumeration, Elimination, and Selection

16 years 1 days ago

The Communication Complexity of Enumeration, Elimination, and Selection

Download www.cs.umd.edu

Andris Ambainis, Harry Buhrman, William I. Gasarch

Real-time Traffic

Algorithms | COCO 2000 |

claim paper

Related Content

» Analyzing NonDeterminism in Telecommunication Services Using PInvariant of PetriNet Model

» Selective Mapping with Symbol ReMapping for OFDMTDM Using MMSEFDE

» Designing Efficient Distributed Algorithms Using Sampling Techniques

» ProjectionBased Multiuser Receiver over Frequency Selective Channels

» Key research problems in NoC design a holistic perspective

» On Girth Conditioning for LowDensity ParityCheck Codes

» Public Key Cryptography in Sensor Networks Revisited

» Restful web services vs big web services making the right architectural decision

» A Localized Algorithm for Parallel Association Mining

Post Info
More Details (n/a)

Added	02 Aug 2010
Updated	02 Aug 2010
Type	Conference
Year	2000
Where	COCO
Authors	Andris Ambainis, Harry Buhrman, William I. Gasarch, Bala Kalyanasundaram, Leen Torenvliet

Comments (0)