Search results: Found 3

Listing 1 - 3 of 3
Sort by
Open Data Structures: An Introduction

Author:
Book Series: OPEL (Open Paths to Enriched Learning) ISSN: 22912614 ISBN: 9781927356388 9781927356395 Year: Pages: 336 Language: English
Publisher: Athabasca University Press
Added to DOAB on : 2014-08-04 17:04:53
License:

Loading...
Export citation

Choose an application

Abstract

Offered as an introduction to the field of data structures and algorithms, Open Data Structures covers the implementation and analysis of data structures for sequences (lists), queues, priority queues, unordered dictionaries, ordered dictionaries, and graphs. Focusing on a mathematically rigorous approach that is fast, practical, and efficient, Morin clearly and briskly presents instruction along with source code. Analyzed and implemented in Java, the data structures presented in the book include stacks, queues, deques, and lists implemented as arrays and linked-lists; space-efficient implementations of lists; skip lists; hash tables and hash codes; binary search trees including treaps, scapegoat trees, and red-black trees; integer searching structures including binary tries, x-fast tries, and y-fast tries; heaps, including implicit binary heaps and randomized meldable heaps; graphs, including adjacency matrix and adjacency list representations; and B-trees. A modern treatment of an essential computer science topic, Open Data Structures is a measured balance between classical topics and state-of-the art structures that will serve the needs of all undergraduate students or self-directed learners.

Intertwingled: The Work and Influence of Ted Nelson

Authors: ---
Book Series: History of Computing ISSN: 21906831 ISBN: 9783319169248 9783319169255 Year: Pages: 150 DOI: 10.1007/978-3-319-16925-5 Language: English
Publisher: Palgrave Macmillan
Subject: Computer Science
Added to DOAB on : 2016-04-22 16:50:48
License:

Loading...
Export citation

Choose an application

Abstract

This engaging volume celebrates the life and work of Theodor Holm “Ted” Nelson, a pioneer and legendary figure from the history of early computing. Presenting contributions from world-renowned computer scientists and figures from the media industry, the book delves into hypertext, the docuverse, Xanadu and other products of Ted Nelson’s unique mind. Features: includes a cartoon and a sequence of poems created in Nelson’s honor, reflecting his wide-ranging and interdisciplinary intellect; presents peer histories, providing a sense of the milieu that resulted from Nelson’s ideas; contains personal accounts revealing what it is like to collaborate directly with Nelson; describes Nelson’s legacy from the perspective of his contemporaries from the computing world; provides a contribution from Ted Nelson himself. With a broad appeal spanning computer scientists, science historians and the general reader, this inspiring collection reveals the continuing influence of the original visionary of the World Wide Web.

Computer Algebra in Scientific Computing

Author:
ISBN: 9783039217304 / 9783039217311 Year: Pages: 160 DOI: 10.3390/books978-3-03921-731-1 Language: eng
Publisher: MDPI - Multidisciplinary Digital Publishing Institute
Subject: Computer Science
Added to DOAB on : 2019-12-09 11:49:16
License:

Loading...
Export citation

Choose an application

Abstract

Although scientific computing is very often associated with numeric computations, the use of computer algebra methods in scientific computing has obtained considerable attention in the last two decades. Computer algebra methods are especially suitable for parametric analysis of the key properties of systems arising in scientific computing. The expression-based computational answers generally provided by these methods are very appealing as they directly relate properties to parameters and speed up testing and tuning of mathematical models through all their possible behaviors. This book contains 8 original research articles dealing with a broad range of topics, ranging from algorithms, data structures, and implementation techniques for high-performance sparse multivariate polynomial arithmetic over the integers and rational numbers over methods for certifying the isolated zeros of polynomial systems to computer algebra problems in quantum computing.

Listing 1 - 3 of 3
Sort by
Narrow your search