1 Introduction and summary of results - Warwick Computer Science ...

• mémoire - matière potentielle : location
• mémoire - matière potentielle : image m
• mémoire
• mémoire - matière potentielle : image
• exposé - matière potentielle : the problem
• mémoire - matière potentielle : images
• exposé
• fiche de synthèse - matière potentielle : results

Lower bounds for Union-Split-Find related problems on random access machines Peter Bro Miltersen Aarhus University and University of Warwick Abstract We prove ( p log logn) lower bounds on the random access machine com- plexity of several dynamic, partially dynamic and static data structure prob- lems, including the union-split-nd problem, dynamic prex problems and one- dimensional range query problems. The proof techniques include a general technique using perfect hashing for reducing static data structure problems (with a restriction of the size of the structure) into partially dynamic data structure problems (with no such restriction), thus providing a way to transfer

• random access computer
• find problem
• dynamic problems
• static data structure
• decision assignment tree model
• lower bounds
• data structure
• size