Dinur, I.; Regev, O.; Smyth, C.
Page(s): 33- 40
Digital Object Identifier 10.1109/SFCS.2002.1181880 Abstract
| Full Text: PDF (368 KB)
Rights and Permissions
Small induced-universal graphs and compact implicit graph representations
Alstrup, S.; Rauhe, T.
Page(s): 53- 62
Digital Object Identifier 10.1109/SFCS.2002.1181882 Abstract
| Full Text: PDF (392 KB)
Rights and Permissions
Deterministic broadcasting time in radio networks of unknown topology
Kowalski, D.R.; Pelc, A.
Page(s): 63- 72
Digital Object Identifier 10.1109/SFCS.2002.1181883 Abstract
| Full Text: PDF (361 KB)
Rights and Permissions
Explicit unique-neighbor expanders
Alon, N.; Capalbo, M.
Page(s): 73- 79
Digital Object Identifier 10.1109/SFCS.2002.1181884 Abstract
| Full Text: PDF (330 KB)
Rights and Permissions
Abstract combinatorial programs and efficient property testers
Czumaj, A.; Sohler, C.
Page(s): 83- 92
Digital Object Identifier 10.1109/SFCS.2002.1181885 Abstract
| Full Text: PDF (445 KB)
Rights and Permissions
A lower bound for testing 3-colorability in bounded-degree graphs
Bogdanov, A.; Obata, K.; Trevisan, L.
Page(s): 93- 102
Digital Object Identifier 10.1109/SFCS.2002.1181886 Abstract
| Full Text: PDF (405 KB)
Rights and Permissions
Testing juntas [combinatorial property testing]
Fischer, E.; Kindler, G.; Ron, D.; Safra, S.; Samorodnitsky, A.
Page(s): 103- 112
Digital Object Identifier 10.1109/SFCS.2002.1181887 Abstract
| Full Text: PDF (410 KB)
Rights and Permissions
A spectral algorithm for learning mixtures of distributions
Vempala, S.; Wang, G.
Page(s): 113- 122
Digital Object Identifier 10.1109/SFCS.2002.1181888 Abstract
| Full Text: PDF (613 KB)
Rights and Permissions
Equivalence between priority queues and sorting
Thorup, M.
Page(s): 125- 134
Digital Object Identifier 10.1109/SFCS.2002.1181889 Abstract
| Full Text: PDF (365 KB)
Rights and Permissions
Integer sorting in O(n√(log log n)) expected time and linear space
Yijie Han; Thorup, M.
Page(s): 135- 144
Digital Object Identifier 10.1109/SFCS.2002.1181890 Abstract
| Full Text: PDF (372 KB)
Rights and Permissions
Implicit B-trees: New results for the dictionary problem
Franceschini, G.; Grossi, R.; Munro, J.I.; Pagli, L.
Page(s): 145- 154
Digital Object Identifier 10.1109/SFCS.2002.1181891 Abstract
| Full Text: PDF (379 KB)
Rights and Permissions
An inverse-Ackermann style lower bound for the online minimum spanning tree verification problem
Pettie, S.
Page(s): 155- 163
Digital Object Identifier 10.1109/SFCS.2002.1181892 Abstract
| Full Text: PDF (368 KB)
Rights and Permissions
PAC=PAExact and other equivalent models in learning
Bshouty, N.H.; Gavinsky, D.
Page(s): 167- 176
Digital Object Identifier 10.1109/SFCS.2002.1181893 Abstract
| Full Text: PDF (1900 KB)
Rights and Permissions
Learning intersections and thresholds of halfspaces
Klivans, A.R.; O'Donnell, R.
Page(s): 177- 186
Digital Object Identifier 10.1109/SFCS.2002.1181894 Abstract
| Full Text: PDF (389 KB)
Rights and Permissions
On-line confidence machines are well-calibrated
Vovk, V.
Page(s): 187- 196
Digital Object Identifier 10.1109/SFCS.2002.1181895 Abstract
| Full Text: PDF (411 KB)
Rights and Permissions
Learning a hidden matching
Alon, N.; Beigel, R.; Kasif, S.; Rudich, S.; Sudakov, B.
Page(s): 197- 206
Digital Object Identifier 10.1109/SFCS.2002.1181943 Abstract
| Full Text: PDF (373 KB)
Rights and Permissions
An information statistics approach to data stream and communication complexity
Bar-Yossef, Z.; Jayram, T.S.; Kumar, R.; Sivakumar, D.
Page(s): 209- 218
Digital Object Identifier 10.1109/SFCS.2002.1181944 Abstract
| Full Text: PDF (427 KB)
Rights and Permissions
Static optimality theorem for external memory string access
Ciriani, V.; Ferragina, P.; Luccio, F.; Muthukrishnan, S.
Page(s): 219- 227
Digital Object Identifier 10.1109/SFCS.2002.1181945 Abstract
| Full Text: PDF (378 KB)
Rights and Permissions
A simple algorithmic characterization of uniform solvability
Gafni, E.
Page(s): 228- 237
Digital Object Identifier 10.1109/SFCS.2002.1181946 Abstract
| Full Text: PDF (361 KB)
Rights and Permissions
Cart
