Pascal and Francis Bibliographic Databases

Help

Search results

Your search

is.\*:("0097-5397")

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

ALGORITHMIC ASPECTS OF PROPERTY TESTING IN THE DENSE GRAPHS MODELGOLDREICH, Oded; RON, Dana.SIAM journal on computing (Print). 2011, Vol 40, Num 2, pp 376-445, issn 0097-5397, 70 p.Article

AN ANALYSIS OF RANDOM-WALK CUCKOO HASHINGFRIEZE, Alan; MELSTED, Pall; MITZENMACHER, Michael et al.SIAM journal on computing (Print). 2011, Vol 40, Num 2, pp 291-308, issn 0097-5397, 18 p.Article

HOW HARD IS IT TO APPROXIMATE THE BEST NASH EQUILIBRIUM?HAZAN, Elad; KRAUTHGAMER, Robert.SIAM journal on computing (Print). 2011, Vol 40, Num 1, pp 79-91, issn 0097-5397, 13 p.Article

MATCHING VECTOR CODESDVIR, Zeev; GOPALAN, Parikshit; YEKHANIN, Sergey et al.SIAM journal on computing (Print). 2011, Vol 40, Num 4, pp 1154-1178, issn 0097-5397, 25 p.Article

SEARCH VIA QUANTUM WALKMAGNIEZ, Frédéric; NAYAK, Ashwin; ROLAND, Jeremie et al.SIAM journal on computing (Print). 2011, Vol 40, Num 1, pp 142-164, issn 0097-5397, 23 p.Article

SEMIALGEBRAIC RANGE REPORTING AND EMPTINESS SEARCHING WITH APPLICATIONSSHARIR, Micha; SHAUL, Hayim.SIAM journal on computing (Print). 2011, Vol 40, Num 4, pp 1045-1074, issn 0097-5397, 30 p.Article

SORTING AND SELECTION IN POSETSDASKALAKIS, Constantinos; KARP, Richard M; MOSSEL, Elchanan et al.SIAM journal on computing (Print). 2011, Vol 40, Num 3, pp 597-622, issn 0097-5397, 26 p.Article

TESTING FOURIER DIMENSIONALITY AND SPARSITYGOPALAN, Parikshit; O'DONNELL, Ryan; SERVEDIO, Rocco A et al.SIAM journal on computing (Print). 2011, Vol 40, Num 4, pp 1075-1100, issn 0097-5397, 26 p.Article

UNCOORDINATED TWO-SIDED MATCHING MARKETSACKERMANN, Heiner; GOLDBERG, Paul W; MIRROKNI, Vahab S et al.SIAM journal on computing (Print). 2011, Vol 40, Num 1, pp 92-106, issn 0097-5397, 15 p.Article

UNIFYING THE LANDSCAPE OF CELL-PROBE LOWER BOUNDS : Foundation of Computer SciencePATRASCU, Mihai.SIAM journal on computing (Print). 2011, Vol 40, Num 3, pp 827-847, issn 0097-5397, 21 p.Article

EXACT PRICE OF ANARCHY FOR POLYNOMIAL CONGESTION GAMESALAND, Sebastian; DUMRAUF, Dominic; GAIRING, Martin et al.SIAM journal on computing (Print). 2011, Vol 40, Num 5, pp 1211-1233, issn 0097-5397, 23 p.Article

FAST POLYNOMIAL FACTORIZATION AND MODULAR COMPOSITION : Forfieth Annual ACM Symposium on Theory of omputing (STOC 2008)KEDLAYA, Kiran S; UMANS, Christopher.SIAM journal on computing (Print). 2011, Vol 40, Num 6, pp 1767-1802, issn 0097-5397, 36 p.Article

RANK-PAIRING HEAPSHAEUPLER, Bernhard; SEN, Siddhartha; TARJAN, Robert E et al.SIAM journal on computing (Print). 2011, Vol 40, Num 6, pp 1463-1485, issn 0097-5397, 23 p.Article

TESTING SYMMETRIC PROPERTIES OF DISTRIBUTIONS : Forfieth Annual ACM Symposium on Theory of omputing (STOC 2008)VALIANT, Paul.SIAM journal on computing (Print). 2011, Vol 40, Num 6, pp 1927-1968, issn 0097-5397, 42 p.Article

AN OPTIMAL RANDOMIZED CELL PROBE LOWER BOUND FOR APPROXIMATE NEAREST NEIGHBOR SEARCHINGCHAKRABARTI, Amit; REGEV, Oded.SIAM journal on computing (Print). 2010, Vol 39, Num 5, pp 1919-1940, issn 0097-5397, 22 p.Article

CIRCUIT LOWER BOUNDS FOR MERLIN-ARTHUR CLASSES : Theory of ComputingSANTHANAM, Rahul.SIAM journal on computing (Print). 2010, Vol 39, Num 3, pp 1038-1061, issn 0097-5397, 24 p.Article

FINDING A HEAVIEST VERTEX-WEIGHTED TRIANGLE IS NOT HARDER THAN MATRIX MULTIPLICATIONCZUMAJ, Artur; LINGAS, Andrzej.SIAM journal on computing (Print). 2010, Vol 39, Num 2, pp 431-444, issn 0097-5397, 14 p.Article

LINEAR PROBING WITH CONSTANT INDEPENDENCE : Theory of ComputingPAGH, Anna; PAGH, Rasmus; RUZIC, Milan et al.SIAM journal on computing (Print). 2010, Vol 39, Num 3, pp 1107-1120, issn 0097-5397, 14 p.Article

PASS-EFFICIENT ALGORITHMS FOR LEARNING MIXTURES OF UNIFORM DISTRIBUTIONSCHANG, Kevin L; KANNAN, Ravi.SIAM journal on computing (Print). 2010, Vol 39, Num 3, pp 783-812, issn 0097-5397, 30 p.Article

SELFISH TRAFFIC ALLOCATION FOR SERVER FARMSCZUMAJ, Artur; KRYSTA, Piotr; VÖCKING, Berthold et al.SIAM journal on computing (Print). 2010, Vol 39, Num 5, pp 1957-1987, issn 0097-5397, 31 p.Article

A COMPLEXITY DICHOTOMY FOR PARTITION FUNCTIONS WITH MIXED SIGNSGOLDBERG, Leslie Ann; GROHE, Martin; JERRUM, Mark et al.SIAM journal on computing (Print). 2010, Vol 39, Num 7-8, pp 3336-3402, issn 0097-5397, 67 p.Article

AN EFFICIENT ALGORITHM FOR PARTIAL ORDER PRODUCTIONCARDINAL, Jean; FIORINI, Samuel; JORET, Gwenael et al.SIAM journal on computing (Print). 2010, Vol 39, Num 7-8, pp 2927-2940, issn 0097-5397, 14 p.Article

AN OPTIMAL BIFACTOR APPROXIMATION ALGORITHM FOR THE METRIC UNCAPACITATED FACILITY LOCATION PROBLEMBYRKA, Jaroslaw; AARDAL, Karen.SIAM journal on computing (Print). 2010, Vol 39, Num 6, pp 2212-2231, issn 0097-5397, 20 p.Article

ANALYSIS OF DELAYS CAUSED BY LOCAL SYNCHRONIZATIONLIPMAN, Julia; STOUT, Quentin F.SIAM journal on computing (Print). 2010, Vol 39, Num 7-8, pp 3860-3884, issn 0097-5397, 25 p.Article

APPROXIMATELY COUNTING INTEGRAL FLOWS AND CELL-BOUNDED CONTINGENCY TABLESCRYAN, Mary; DYER, Martin; RANDALL, Dana et al.SIAM journal on computing (Print). 2010, Vol 39, Num 7-8, pp 2683-2703, issn 0097-5397, 21 p.Article

  • Page / 88