Shared by:Abee
Written by Various
Format(s): PDF TXT
Language: English
Future prospects in algorithm research Growth of and advances in space efficient data structures Sorting and searching in data structures. This Festschrift volume, published in honour of J. Ian Munro, contains contributions written by some of his colleagues, former students, and friends. In celebration of his 66th birthday the colloquium "Conference on Space Efficient Data Structures, Streams and Algorithms" was held in Waterloo, ON, Canada, during August 15-16, 2013. The articles presented herein cover some of the main topics of Ian's research interests. Together they give a good overall perspective of the last 40 years of research in algorithms and data structures.
TABLE OF CONTENTS
The Query Complexity of Finding a Hidden Permutation.- Bounds for Scheduling Jobs on Grid Processors.- Quake Heaps: A Simple Alternative to Fibonacci Heaps.- Variations on Instant Insanity.- A Simple Linear-Space Data Structure for Constant-Time Range.- Closing a Long-Standing Complexity Gap for Selection: V3(42) = 50.- Frugal Streaming for Estimating Quantiles.- From Time to Space: Fast Algorithms That Yield Small and Fast Data.- Computing (and life) Is all About Tradeoffs: A Small Sample of Some Computational Tradeoffs.- A History of Distribution-Sensitive Data Structures.- A Survey on Priority Queues.- On Generalized Comparison-Based Sorting Problems.- A Survey of the Game ΓÇ£Lights Out!ΓÇ¥.- Random Access to High-Order Entropy Compressed Text.- Succinct and Implicit Data Structures for Computational Geometry.- In Pursuit of the Dynamic Optimality Conjecture.- A Survey of Algorithms and Models for List Update.- Orthogonal Range Searching for Text Indexing.- A Survey of Data Structures in the Bitprobe Model.- Succinct Representations of Ordinal Trees.- Array Range Queries.- Indexes for Document Retrieval with Relevance.
Series: Lecture Notes in Computer Science / Theoretical Computer Science and General Issues
Paperback: 391 pages
Publisher: Springer; 2013 edition (August 7, 2013)
Language: English
ISBN-10: 3642402720
ISBN-13: 978-3642402722
| Announce URL: | udp://tracker.publicbt.com:80/announce |
| This Torrent also has several backup trackers | |
| Tracker: | udp://tracker.publicbt.com:80/announce |
| Tracker: | udp://tracker.openbittorrent.com:80/announce |
| Tracker: | udp://tracker.istole.it:80/announce |
| Tracker: | udp://ipv4.tracker.harry.lu:80/announce |
| Tracker: | http://exodus.desync.com/announce |
| Tracker: | udp://open.demonii.com:1337/announce |
| Tracker: | udp://11.rarbg.com:80/announce |
| Tracker: | http://tracker.yibis.com:6969/announce |
| Tracker: | udp://explodie.org:6969/announce |
| Tracker: | http://thetracker.org./announce |
| Tracker: | http://tracker.bittorrent.am/announce |
| Tracker: | http://fr33dom.h33t.eu:3310/announce |
| Tracker: | udp://9.rarbg.com:2710/announce |
| Tracker: | http://p2pdl.com:2710/announce |
| Tracker: | http://bigfoot1942.sektori.org:6969/announce |
| Tracker: | http://tracker.nwps.ws:6969/announce |
| Info Hash: | 7393e00dc81ab3a08e5d0161f9f0778942d950a4 |
| Creation Date: | Tue, 10 Dec 2013 14:39:13 +0000 |
| This is a Multifile Torrent | |
| Space-Efficient Data Structures, Streams And Algorithms ABEE.pdf 3.94 MBs | |
| cover.jpg 31.1 KBs | |
| info.txt 2.35 KBs | |
| Combined File Size: | 3.97 MBs |
| Piece Size: | 16 KBs |
| Comment: | Abee India |
| Torrent Encoding: | UTF-8 |
| Seeds: | 96 |
| Peers: | 2 |
| Completed Downloads: | 528 |
| Torrent Download: | Torrent Free Downloads |
| Tips: | Sometimes the torrent health info isn't accurate, so you can download the file and check it out or try the following downloads. |
| Direct Download: | Download Files Now |
| Tips: | You could try out the alternative bittorrent clients. |
| Secured Download: | Start Anonymous Download |
| Ads: |
|
