Pascal and Francis Bibliographic Databases

Help

Search results

Your search

jo.\*:("SIAM journal on computing (Print)")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 2193

  • Page / 88

Export

Selection :

  • and

A COMBINATORIAL CONSTRUCTION OF ALMOST-RAMANUJAN GRAPHS USING THE ZIG-ZAG PRODUCTBEN-AROYA, Avraham; TA-SHMA, Amnon.SIAM journal on computing (Print). 2011, Vol 40, Num 2, pp 267-290, issn 0097-5397, 24 p.Article

A TOPOLOGICAL VIEW OF UNSUPERVISED LEARNING FROM NOISY DATANIYOGI, P; SMALE, S; WEINBERGER, S et al.SIAM journal on computing (Print). 2011, Vol 40, Num 3, pp 646-663, issn 0097-5397, 18 p.Article

BLACK-BOX CONSTRUCTIONS OF PROTOCOLS FOR SECURE COMPUTATIONHAITNER, Iftach; ISHAI, Yuval; KUSHILEVITZ, Eyal et al.SIAM journal on computing (Print). 2011, Vol 40, Num 2, pp 225-266, issn 0097-5397, 42 p.Article

DEGREE BOUNDED NETWORK DESIGN WITH METRIC COSTSYUK HEI CHAN; WAI SHING FUNG; LAP CHI LAU et al.SIAM journal on computing (Print). 2011, Vol 40, Num 4, pp 953-980, issn 0097-5397, 28 p.Article

KAKEYA SETS, NEW MERGERS, AND OLD EXTRACTORS : Foundation of Computer ScienceDVIR, Zeev; WIGDERSON, Avi.SIAM journal on computing (Print). 2011, Vol 40, Num 3, pp 778-792, issn 0097-5397, 15 p.Article

MULTIWRITER CONSISTENCY CONDITIONS FOR SHARED MEMORY REGISTERSCHENG SHAO; WELCH, Jennifer L; PIERCE, Evelyn et al.SIAM journal on computing (Print). 2011, Vol 40, Num 1, pp 28-62, issn 0097-5397, 35 p.Article

RANDOMLY SUPPORTED INDEPENDENCE AND RESISTANCEAUSTRIN, Per; HASTAD, Johan.SIAM journal on computing (Print). 2011, Vol 40, Num 1, pp 1-27, issn 0097-5397, 27 p.Article

THE CHOW PARAMETERS PROBLEMO'DONNELL, Ryan; SERVEDIO, Rocco A.SIAM journal on computing (Print). 2011, Vol 40, Num 1, pp 165-199, issn 0097-5397, 35 p.Article

GRAPH SPARSIFICATION BY EFFECTIVE RESISTANCES : Forfieth Annual ACM Symposium on Theory of omputing (STOC 2008)SPIELMAN, Daniel A; SRIVASTAVA, Nikhil.SIAM journal on computing (Print). 2011, Vol 40, Num 6, pp 1913-1926, issn 0097-5397, 14 p.Article

INTERVAL GRAPHS: CANONICAL REPRESENTATIONS IN LOGSPACEKÖBLER, Johannes; KUHNERT, Sebastian; LAUBNER, Bastian et al.SIAM journal on computing (Print). 2011, Vol 40, Num 5, pp 1292-1315, issn 0097-5397, 24 p.Article

LOSSY TRAPDOOR FUNCTIONS AND THEIR APPLICATIONS : Forfieth Annual ACM Symposium on Theory of omputing (STOC 2008)PEIKERT, Chris; WATERS, Brent.SIAM journal on computing (Print). 2011, Vol 40, Num 6, pp 1803-1844, issn 0097-5397, 42 p.Article

MAXIMIZING A MONOTONE SUBMODULAR FUNCTION SUBJECT TO A MATROID CONSTRAINT : Forfieth Annual ACM Symposium on Theory of omputing (STOC 2008)CALINESCU, Gruia; CHEKURI, Chandra; PAL, Martin et al.SIAM journal on computing (Print). 2011, Vol 40, Num 6, pp 1740-1766, issn 0097-5397, 27 p.Article

ON THE POWER OF THE RANDOMIZED ITERATEHAITNER, Iftach; HARNIK, Danny; REINGOLD, Omer et al.SIAM journal on computing (Print). 2011, Vol 40, Num 6, pp 1486-1528, issn 0097-5397, 43 p.Article

SAMPLING AND COST-SHARING: APPROXIMATION ALGORITHMS FOR STOCHASTIC OPTIMIZATION PROBLEMSGUPTA, Anupam; PAL, Martin; RAVI, R et al.SIAM journal on computing (Print). 2011, Vol 40, Num 5, pp 1361-1401, issn 0097-5397, 41 p.Article

SKETCHING IN ADVERSARIAL ENVIRONMENTS : Forfieth Annual ACM Symposium on Theory of omputing (STOC 2008)MIRONOV, Ilya; NAOR, Moni; SEGEV, Gil et al.SIAM journal on computing (Print). 2011, Vol 40, Num 6, pp 1845-1870, issn 0097-5397, 26 p.Article

BREAKING THE -SOUNDNESS BOUND OF THE LINEARITY TEST OVER GF(2)KAUFMAN, Tali; LITSYN, Simon; NING XIE et al.SIAM journal on computing (Print). 2010, Vol 39, Num 5, pp 1988-2003, issn 0097-5397, 16 p.Article

COMBINATORIAL CONSTRUCTION OF LOCALLY TESTABLE CODESMEIRT, O. R.SIAM journal on computing (Print). 2010, Vol 39, Num 2, pp 491-544, issn 0097-5397, 54 p.Article

INFORMATION-THEORETICALLY SECURE PROTOCOLS AND SECURITY UNDER COMPOSITIONKUSHILEVITZ, Eyal; LINDELL, Yehuda; RABIN, Tal et al.SIAM journal on computing (Print). 2010, Vol 39, Num 5, pp 2090-2112, issn 0097-5397, 23 p.Article

INTRACTABILITY OF CLIQUE-WIDTH PARAMETERIZATIONSFOMIN, Fedor V; GOLOVACH, Petr A; LOKSHTANOV, Daniel et al.SIAM journal on computing (Print). 2010, Vol 39, Num 5, pp 1941-1956, issn 0097-5397, 16 p.Article

LOW-END UNIFORM HARDNESS VERSUS RANDOMNESS TRADEOFFS FOR AM : Theory of ComputingSHALTIEL, Ronen; UMANS, Christopher.SIAM journal on computing (Print). 2010, Vol 39, Num 3, pp 1006-1037, issn 0097-5397, 32 p.Article

ON EARTHMOVER DISTANCE, METRIC LABELING, AND 0-EXTENSIONKARLOFF, Howard; KHOT, Subhash; MEHTA, Aranyak et al.SIAM journal on computing (Print). 2010, Vol 39, Num 2, pp 371-387, issn 0097-5397, 17 p.Article

AN O(1) RMRs LEADER ELECTION ALGORITHMGOLAB, Wojciech; HENDLER, Danny; WOELFEL, Philipp et al.SIAM journal on computing (Print). 2010, Vol 39, Num 7-8, pp 2726-2760, issn 0097-5397, 35 p.Article

EXTENSION PRESERVATION THEOREMS ON CLASSES OF ACYCLIC FINITE STRUCTURESDURIS, David.SIAM journal on computing (Print). 2010, Vol 39, Num 7-8, pp 3670-3681, issn 0097-5397, 12 p.Article

HARDNESS OF RECONSTRUCTING MULTIVARIATE POLYNOMIALS OVER FINITE FIELDS : Foundations of Computer ScienceGOPALAN, Parikshit; KHOT, Subhash; SAKET, Rishi et al.SIAM journal on computing (Print). 2010, Vol 39, Num 6, pp 2598-2621, issn 0097-5397, 24 p.Article

ON THE APPROXIMABILITY OF BUDGETED ALLOCATIONS AND IMPROVED LOWER BOUNDS FOR SUBMODULAR WELFARE MAXIMIZATION AND GAPCHAKRABARTY, Deeparnab; GOEL, Gagan.SIAM journal on computing (Print). 2010, Vol 39, Num 6, pp 2189-2211, issn 0097-5397, 23 p.Article

  • Page / 88