SCOPUS 정보 검색 플랫폼

Information Processing Letters

Volumn 83, Issue 5, 2002, Pages 267-274

Storing information with extractors

(1) Ta Shma, Amnon a

a TEL AVIV UNIVERSITY (Israel)

Author keywords

Condensers; Data structures; Expanders; Extractors; List decoding

Indexed keywords

COMPUTATIONAL COMPLEXITY; DECODING; ENCODING (SYMBOLS); GRAPH THEORY; INFORMATION RETRIEVAL SYSTEMS; MEMBERSHIP FUNCTIONS; PROBABILITY; PROBLEM SOLVING; SET THEORY;

LIST DECODING;

DATA STRUCTURES;

EID: 0037105924 PISSN: 00200190 EISSN: None Source Type: Journal
DOI: 10.1016/S0020-0190(02)00206-5 Document Type: Article

Times cited : (24)

References (15)

1
- 0002237180
- Membership in constant time and minimum space
- J. van Leeuwen (ed.), Algorithms - ESA'94, Springer, Berlin
- (1994) Lecture Notes in Comput. Sci. , vol.855 , pp. 72-81
- Brodnik, A.¹ Munro, J.I.²

2
- 0033701727
- Are bitvectors optimal?
- (2000) Proceedings of the 32nd Annual ACM Symposium on Theory of Computing , pp. 449-458
- Buhrman, H.¹ Miltersen, P.B.² Radhakrishnan, J.³ Venkatesh, S.⁴

3
- 0021467937
- Sorting a sparse table with o(1) worst case access time
- (1984) J. ACM , vol.31 , Issue.3 , pp. 538-544
- Fredman, M.L.¹ Komlos, J.² Szemeredi, E.³

4
- 0026931776
- Non-oblivious hashing
- (1992) J. ACM , vol.39 , pp. 764-782
- Fiat, A.¹ Naor, M.² Schmidt, J.P.³ Siegel, A.⁴

5
- 0033690275
- List decoding algorithms for certain concatenated codes
- (2000) Proceedings of the 32nd Annual ACM Symposium on Theory of Computing , pp. 181-190
- Guruswami, V.¹ Sudan, M.²

6
- 0004290881
- MIT Press, Cambridge, MA
- (1969) Perceptrons
- Minsky, M.¹ Papert, S.²

7
- 43949088556
- Low redundancy in static dictionaries with O(1) worst case lookup time
- J. Wiedermann van Emde Boas, M. Nielsen (Eds.), ICALP'99, Springer, Berlin
- (1999) Lecture Notes in Comp. Sci. , vol.1644 , pp. 595-604
- Pagh, R.¹

8
- 0032650476
- On recycling the randomness of states in space bounded computation
- (1999) Proceedings of the 31st Annual ACM Symposium on Theory of Computing , pp. 159-168
- Raz, R.¹ Reingold, O.²

9
- 0032629108
- Extracting all the randomness and reducing the error in trevisan's extractors
- (1999) Proceedings of the 31st Annual ACM Symposium on Theory of Computing , pp. 159-168
- Raz, R.¹ Reingold, O.² Vadhan, S.³

10
- 0032624550
- Construction of extractors using pseudo-random generators (extended abstract)
- (1999) Proceedings of the 31st Annual ACM Symposium on Theory of Computing , pp. 141-148
- Trevisan, L.¹

11
- 0034832181
- Loss-less condensers, unbalanced expanders, and extractors
- (2001) Proceedings of the 33rd Annual ACM Symposium on Theory of Computing , pp. 143-152
- Ta-Shma, A.¹ Umans, C.² Zuckerman, D.³

12
- 0034826178
- Extractor codes (extended abstract)
- (2001) Proceedings of the 33rd Annual ACM Symposium on Theory of Computing , pp. 193-199
- Ta-Shma, A.¹ Zuckerman, D.²

13
- 4243759637
- Manuscript
- (2001) Extractor codes (full version)
- Ta-Shma, A.¹ Zuckerman, D.²

14
- 0027306477
- Expanders that beat the eigenvalue bound: Explicit construction and applications
- (1993) Proceedings of the 25th Annual ACM Symposium on Theory of Computing , pp. 245-251
- Wigderson, A.¹ Zuckerman, D.²

15
- 0019591034
- Should tables be sorted?
- (1981) J. ACM , vol.28 , Issue.3 , pp. 615-628
- Yao, A.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.