Počet záznamů: 1
The hardness of being private
SYS 0386317 LBL 02739^^^^^2200397^^^450 005 20240103201842.9 014 $a 000308976600020 $2 WOS 014 $a 84866510748 $2 SCOPUS 017 70
$a 10.1109/CCC.2012.24 $2 DOI 100 $a 20130320d m y slo 03 ba 101 0-
$a eng $d eng 102 $a US 200 1-
$a The hardness of being private 215 $a 11 s. $c P 463 -1
$1 001 cav_un_epca*0385826 $1 010 $a 978-0-7695-4708-4 $1 011 $a 1093-0159 $1 200 1 $a 2012 IEEE 27th Annual Conference on Computational Complexity (CCC) $v S. 192-202 $1 210 $a New York $c IEEE $d 2012 $1 225 $a Annual IEEE Conference on Computational Complexity 610 0-
$a privacy 610 0-
$a communication complexity 610 0-
$a Vickrey auctions 700 -1
$3 cav_un_auth*0287317 $a Ada $b A. $y CA $4 070 701 -1
$3 cav_un_auth*0217301 $a Chattopadhyay $b A. $y CA $4 070 701 -1
$3 cav_un_auth*0287318 $a Cook $b S.A. $y CA $4 070 701 -1
$3 cav_un_auth*0287319 $a Fontes $b L. $y CA $4 070 701 -1
$3 cav_un_auth*0215097 $a Koucký $b Michal $i Matematická logika a teoretická informatika $j Mathematical Logic and Theoretical Computer Science $l MLTCS $p MU-W $w Mathematical Logic and Theoretical Computer Science $4 070 $T Matematický ústav AV ČR, v. v. i. 701 -1
$3 cav_un_auth*0287320 $a Pitassi $b T. $y CA $4 070 856 $u http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6243395
Počet záznamů: 1