Top results
jmlr: workshop and conference proceedings vol 23 (2012) 26.1–26.22 25th annual conference on learning theory distributed learning, communication complexity and privacy
control communication complexity of distributed actions wing shing wong and john baillieul abstract—recent papers have treated control communication complexity in the
()disjointness∗ alexander a. sherstov† abstract. in the k-party set disjointness problem, the goal is to determine whether given subsets s1, s2, . . . , sk
communication complexity of estimating correlations uri hadar∗ tel aviv university israel urihadar@mailtauacil jingbo liu mit cambridge ma jingbo@mitedu yury polyanskiy…
1 complexity of algorithms lecture notes spring 1999 peter gács boston university and lászló lovász yale university 2 contents 1 introduction and preliminaries 1…
communication complexity communication complexity jaikumar radhakrishnan school of technology and computer science tata institute of fundamental research mumbai 4 july 2008,…
exponential separation of information and communication anat ganor∗ gillat kol† ran raz‡ abstract we show an exponential gap between communication complexity and information…
proof complexity in the last decade: accomplishments, obstacles and open problems communication complexity, information complexity and applications to privacy toniann pitassi…
slide 1property testing and communication complexity grigory yaroslavtsev http://grigory.us slide 2 property testing [goldreich, goldwasser, ron, rubinfeld, sudan] no yes…
randomization carmella kroitoru seminar on communication complexity what’s new? until now, alice and bob were all powerful, but deterministic. but what if alice and bob…
the partition bound for classical communication complexity and query complexity new direct product results in communication complexity rahul jain centre for quantum technologies…
model of computation main theorem and proof outline an upper bound conclusions unbounded error communication complexity of xor functions arkadev chattopadhyay nikhil mande…
thesis.dviby yufan zhu a dissertation submitted in partial fulfillment of the requirements for the degree of doctor of philosophy (computer science and engineering) in the
petro poutanen1*, kalle siira2, pekka aula3 1 university of helsinki, finland 2 constra group, helsinki, finland 3 finnish academy of science and letters, helsinki, finland
proof complexity of natural formulas via communication argumentsproof complexity of natural formulas via communication arguments dmitry itsykson # st. petersburg department
abstract recent papers have treated control communication complexity in the context of information-based, multiple agent control systems including nonlinear systems of the
lower bounds in communication complexity: a survey troy lee columbia university adi shraibman weizmann institute abstract we survey lower bounds in communication complexity.…
communication complexity alexander a. razborov abstract. when i was asked to write a contribution for this book about something related to my research, i immediately thought…
journal of complexity 3 231-243 1987 communication complexity of convex optimization* john n tsitsiklis and zhi-quan luo laboratory for information and decision systems and…
multiparty communication complexity and threshold circuit size of ac0 paul beame∗ computer science and engineering university of washington seattle wa 98195-2350 beame@cswashingtonedu…