SIGN IN
SIGN UP
Alternation and redundancy analysis of the intersection problem
Full Text:
Pdf
Buy this Article
Authors:
Jérémy Barbay
University of Chile, Santiago, Chile
Claire Kenyon
Brown University, Providence, RI
Published in:
· Journal
ACM Transactions on Algorithms (TALG)
TALG Homepage
archive
Volume 4 Issue 1, March 2008
Article No. 4
ACM
New York, NY
, USA
table of contents
doi>
10.1145/1328911.1328915
2008 Article
Research
Refereed
Bibliometrics
· Downloads (6 Weeks): 4
· Downloads (12 Months): 24
· Downloads (cumulative): 288
· Citation Count: 5
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
adaptive analysis
algorithms
alternation analysis
intersection
intersection of sorted arrays
randomized algorithm
redundancy analysis
search process
sorting and searching
theory
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder