skip to content
A lower bound to the complexity of Euclidean and rectilinear matching algorithms Preview this item
ClosePreview this item
Checking...

A lower bound to the complexity of Euclidean and rectilinear matching algorithms

Author: Michael D Grigoriadis; Bahman Kalantari; Rutgers University. Department of Computer Science.
Publisher: New Brunswick, N.J. : Department of Computer Science, Rutgers University, 1985.
Series: LCSR-TR-69.
Edition/Format:   Book : EnglishView all editions and formats
Database:WorldCat
Rating:

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

 

Find a copy in the library

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

Details

Document Type: Book
All Authors / Contributors: Michael D Grigoriadis; Bahman Kalantari; Rutgers University. Department of Computer Science.
OCLC Number: 606070933
Series Title: LCSR-TR-69.
Responsibility: by M.D. Grigoriadis and B. Kalantari.

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/606070933>
library:oclcnum"606070933"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/606070933>
rdf:typeschema:Book
schema:contributor
schema:contributor
<http://viaf.org/viaf/136641536>
rdf:typeschema:Organization
schema:name"Rutgers University. Department of Computer Science."
schema:creator
schema:datePublished"1985"
schema:exampleOfWork<http://worldcat.org/entity/work/id/904643610>
schema:inLanguage"en"
schema:name"A lower bound to the complexity of Euclidean and rectilinear matching algorithms"
schema:publisher
schema:url

Content-negotiable representations

Close Window

Please sign in to WorldCat 

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