@inproceedings{ad421db90218485aac8498966acb28a8,
title = "On the communication complexity of greater-than",
abstract = "We give a simple information theoretic proof that the public-coin randomized communication complexity of the greater-than function is Ω(logn) for bit-strings of length n.",
author = "Ramamoorthy, {Sivaramakrishnan Natarajan} and Makrand Sinha",
note = "Supported by the National Science Foundation under agreement CCF-1016565; 53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015 ; Conference date: 29-09-2015 Through 02-10-2015",
year = "2016",
month = apr,
day = "4",
doi = "10.1109/ALLERTON.2015.7447037",
language = "English (US)",
series = "2015 53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "442--444",
booktitle = "2015 53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015",
address = "United States",
}