skip to content
Data structures and algorithms Preview this item
ClosePreview this item
Checking...

Data structures and algorithms

Author: Alfred V Aho; John E Hopcroft; Jeffrey D Ullman
Publisher: Reading, Mass. : Addison-Wesley ; New Delhi (India) : Dorling Kindersley, 1983.
Series: Addison-Wesley series in computer science and information processing.
Edition/Format:   Book : EnglishView all editions and formats
Database:WorldCat
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: Alfred V Aho; John E Hopcroft; Jeffrey D Ullman
ISBN: 8178081024 9788178081021 8177588265 9788177588262
OCLC Number: 818810207
Notes: Includes index.
Description: xi, 433 p. : ill. ; 25 cm.
Series Title: Addison-Wesley series in computer science and information processing.
Responsibility: by Alfred V. Aho, John E. Hopcroft and Jeffrey D. Ullman.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/818810207>
library:oclcnum"818810207"
library:placeOfPublication
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/818810207>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:contributor
schema:contributor
schema:copyrightYear"1983"
schema:creator
schema:datePublished"1983"
schema:datePublished"2006"
schema:exampleOfWork<http://worldcat.org/entity/work/id/571333>
schema:inLanguage"en"
schema:name"Data structures and algorithms"
schema:numberOfPages"433"
schema:publisher
schema:publisher
schema:url
schema:workExample
schema:workExample

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.