Result 1 to 20 of 61 total
A discrepancy lower bound for information complexity. (English)
Gupta, Anupam (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 15th international workshop, APPROX 2012, and 16th international workshop, RANDOM 2012, Cambridge, MA, USA, August 15‒17, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32511-3/pbk). Lecture Notes in Computer Science 7408, 459-470 (2012).
1
Computability of Brolin-Lyubich measure. (English)
Commun. Math. Phys. 308, No. 3, 743-771 (2011).
2
Inapproximability of NP-complete variants of Nash equilibrium. (English)
Goldberg, Leslie Ann (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 14th international workshop, APPROX 2011, and 15th international workshop, RANDOM 2011, Princeton, NJ, USA, August 17‒19, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22934-3/pbk). Lecture Notes in Computer Science 6845, 13-25 (2011).
3
Information equals amortized communication. (English)
Comput. Res. Repos. 2011, Article No. 1106.3595 (2011).
4
Inapproximability of NP-complete variants of Nash equilibrium. (English)
Comput. Res. Repos. 2011, Article No. 1104.3760 (2011).
5
Towards deterministic tree code constructions. (English)
Electron. Colloq. Comput. Complex. 18, 64 (2011).
6
Poly-\log arithmic independence fools bounded-depth Boolean circuits. (English)
Commun. ACM 54, No. 4, 108-115 (2011).
7
Matching with couples revisited (English)
ACM Conference on Electronic Commerce, 335-336 (2011).
8
Inapproximability of NP-complete variants of Nash equilibrium (English)
APPROX-RANDOM, 13-25 (2011).
9
Leaky pseudo-entropy functions (English)
ICS, 353-366 (2011).
10
Towards coding for maximum errors in interactive communication (English)
STOC, 159-166 (2011).
11
Polylogarithmic independence fools {\it AC}$^{0}$ circuits. (English)
J. ACM 57, No. 5 (2010).
12
Pebbles and branching programs for tree evaluation. (English)
Comput. Res. Repos. 2010, Article No. 1005.2642 (2010).
13
Pseudorandom generators for regular branching programs (English)
FOCS, 40-47 (2010).
14
How to compress interactive communication (English)
STOC, 67-76 (2010).
15
Fractional pebbling and thrifty branching programs. (English)
Kannan, Ravi (ed.) et al., IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2009), December 15‒17, 2009, Kanpur, India. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-13-2). LIPICS ‒ Leibniz International Proceedings in Informatics 4, 109-120, electronic only (2009).
16
Computability and complexity of Julia sets. (English)
Bauer, Andrej (ed.) et al., 6th international conference on computability and complexity in analysis (CCA’09). Proceedings of the international conference, August 18‒22, 2009, Ljubljana, Slovenia. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-12-5). OASIcs ‒ OpenAccess Series in Informatics 11, 1 p., electronic only (2009).
17
Space-efficient counting in graphs on surfaces. (English)
Comput. Complexity 18, No. 4, 601-649 (2009).
18
Sorting from noisy information. (English)
Comput. Res. Repos. 2009, Article No. 0910.1191 (2009).
19
Branching programs for tree evaluation. (English)
Královič, Rastislav (ed.) et al., Mathematical foundations of computer science 2009. 34th international symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24‒28, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03815-0/pbk). Lecture Notes in Computer Science 5734, 175-186 (2009).
20
Result 1 to 20 of 61 total
Start
Contact
Print
General Help
