A QUANTITATIVE VERSION OF THE GIBBARD-SATTERTHWAITE THEOREM FOR THREE ALTERNATIVES : Foundation of Computer ScienceFRIEDGUT, Ehud; KALAI, Gil; KELLER, Nathan et al.SIAM journal on computing (Print). 2011, Vol 40, Num 3, pp 934-952, issn 0097-5397, 19 p.Article

AN EXPANSION TESTER FOR BOUNDED DEGREE GRAPHSKALE, Satyen; SESHADHRI, C.SIAM journal on computing (Print). 2011, Vol 40, Num 3, pp 709-720, issn 0097-5397, 12 p.Article

COMPUTATIONAL COMPLEXITY OF HOLANT PROBLEMSCAI, Jin-Yi; PINYAN LU; MINGJI XIA et al.SIAM journal on computing (Print). 2011, Vol 40, Num 4, pp 1101-1132, issn 0097-5397, 32 p.Article

ENTANGLED GAMES ARE HARD TO APPROXIMATE : Foundation of Computer ScienceKEMPE, Julia; KOBAYASHI, Hirotada; MATSUMOTO, Keiji et al.SIAM journal on computing (Print). 2011, Vol 40, Num 3, pp 848-877, issn 0097-5397, 30 p.Article

ON ACHIEVING THE BEST OF BOTH WORLDS IN SECURE MULTIPARTY COMPUTATIONISHAI, Yuval; KATZ, Jonathan; KUSHILEVITZ, Eyal et al.SIAM journal on computing (Print). 2011, Vol 40, Num 1, pp 122-141, issn 0097-5397, 20 p.Article

THE COMPLEXITY OF EARLY DECIDING SET AGREEMENTGAFNI, Eli; GUERRAOUI, Rachid; POCHON, Bastian et al.SIAM journal on computing (Print). 2011, Vol 40, Num 1, pp 63-78, issn 0097-5397, 16 p.Article

TRUTHFUL APPROXIMATION SCHEMES FOR SINGLE-PARAMETER AGENTS : Foundation of Computer ScienceDHANGWATNOTAI, Peerapong; DOBZINSKI, Shahar; DUGHMI, Shaddin et al.SIAM journal on computing (Print). 2011, Vol 40, Num 3, pp 915-933, issn 0097-5397, 19 p.Article

FITTING TREE METRICS: HIERARCHICAL CLUSTERING AND PHYLOGENYAILON, Nir; CHARIKAR, Moses.SIAM journal on computing (Print). 2011, Vol 40, Num 5, pp 1275-1291, issn 0097-5397, 17 p.Article

THE RECOGNITION OF TOLERANCE AND BOUNDED TOLERANCE GRAPHSMERTZIOS, George B; SAU, Ignasi; ZAKS, Shmuel et al.SIAM journal on computing (Print). 2011, Vol 40, Num 5, pp 1234-1257, issn 0097-5397, 24 p.Article

A NEAR-TIGHT APPROXIMATION ALGORITHM FOR THE ROBOT LOCALIZATION PROBLEMKOENIG, Sven; MITCHELL, Joseph S. B; MUDGAL, Apurva et al.SIAM journal on computing (Print). 2010, Vol 39, Num 2, pp 461-490, issn 0097-5397, 30 p.Article

QUERYING APPROXIMATE SHORTEST PATHS IN ANISOTROPIC REGIONSCHENG, Siu-Wing; NA, Hyeon-Suk; VIGNERON, Antoine et al.SIAM journal on computing (Print). 2010, Vol 39, Num 5, pp 1888-1918, issn 0097-5397, 31 p.Article

STATISTICALLY HIDING COMMITMENTS AND STATISTICAL ZERO-KNOWLEDGE ARGUMENTS FROM ANY ONE-WAY FUNCTION : Theory of ComputingHAITNER, Iftach; NGUYEN, Minh-Huyen; SHIEN JIN ONG et al.SIAM journal on computing (Print). 2010, Vol 39, Num 3, pp 1153-1218, issn 0097-5397, 66 p.Article

THE ONLINE SET COVER PROBLEMALON, Noga; AWERBUCH, Baruch; AZAR, Yossi et al.SIAM journal on computing (Print). 2010, Vol 39, Num 2, pp 361-370, issn 0097-5397, 10 p.Article

A GENERAL APPROACH FOR INCREMENTAL APPROXIMATION AND HIERARCHICAL CLUSTERINGGUOLONG LIN; NAGARAJAN, Chandrashekhar; RAJARAMAN, Rajmohan et al.SIAM journal on computing (Print). 2010, Vol 39, Num 7-8, pp 3633-3669, issn 0097-5397, 37 p.Article

APPROXIMATE HALFSPACE RANGE COUNTINGARONOV, Boris; SHARIR, Micha.SIAM journal on computing (Print). 2010, Vol 39, Num 7-8, pp 2704-2725, issn 0097-5397, 22 p.Article

APPROXIMATING STEINER NETWORKS WITH NODE-WEIGHTSNUTOV, Zeev.SIAM journal on computing (Print). 2010, Vol 39, Num 7-8, pp 3001-3022, issn 0097-5397, 22 p.Article

LINEAR-TIME ALGORITHMS FOR GEOMETRIC GRAPHS WITH SUBLINEARLY MANY EDGE CROSSINGSEPPSTEIN, David; GOODRICH, Michael T; STRASH, Darren et al.SIAM journal on computing (Print). 2010, Vol 39, Num 7-8, pp 3814-3829, issn 0097-5397, 16 p.Article

LOWER BOUNDS FOR RANDOMIZED CONSENSUS UNDER A WEAK ADVERSARYATTIYA, Hagit; CENSOR-HILLEL, Keren.SIAM journal on computing (Print). 2010, Vol 39, Num 7-8, pp 3885-3904, issn 0097-5397, 20 p.Article

ON THE IMPOSSIBILITY OF A QUANTUM SIEVE ALGORITHM FOR GRAPH ISOMORPHISMMOORE, Cristopher; RUSSELL, Alexander; SNIADY, Piotr et al.SIAM journal on computing (Print). 2010, Vol 39, Num 6, pp 2377-2396, issn 0097-5397, 20 p.Article

QUANTUM COMPUTATION AND THE EVALUATION OF TENSOR NETWORKSARAD, Itai; LANDAU, Zeph.SIAM journal on computing (Print). 2010, Vol 39, Num 7-8, pp 3089-3121, issn 0097-5397, 33 p.Article

QUANTUM HARDCORE FUNCTIONS BY COMPLEXITY-THEORETICAL QUANTUM LIST DECODINGKAWACHI, Akinori; YAMAKAMI, Tomoyuki.SIAM journal on computing (Print). 2010, Vol 39, Num 7-8, pp 2941-2969, issn 0097-5397, 29 p.Article

RANDOMIZED SELF-ASSEMBLY FOR EXACT SHAPESDOTY, David.SIAM journal on computing (Print). 2010, Vol 39, Num 7-8, pp 3521-3552, issn 0097-5397, 32 p.Article

TOWARDS SHARP INAPPROXIMABILITY FOR ANY 2-CSP : Foundations of Computer ScienceAUSTRIN, Per.SIAM journal on computing (Print). 2010, Vol 39, Num 6, pp 2430-2463, issn 0097-5397, 34 p.Article

APPROXIMATE SHORTEST PATHS IN ANISOTROPIC REGIONSCHENG, Siu-Wing; NA, Hyeon-Suk; VIGNERON, Antoine et al.SIAM journal on computing (Print). 2009, Vol 38, Num 3, pp 802-824, issn 0097-5397, 23 p.Article

APPROXIMATION ALGORITHM AND PERFECT SAMPLER FOR CLOSED JACKSON NETWORKS WITH SINGLE SERVERSKIJIMA, S; MATSUI, T.SIAM journal on computing (Print). 2009, Vol 38, Num 4, pp 1484-1503, issn 0097-5397, 20 p.Article