Please note that eDoc will be permanently shut down in the first quarter of 2021!      Home News About Us Contact Contributors Disclaimer Privacy Policy Help FAQ

Home
Search
Quick Search
Advanced
Fulltext
Browse
Collections
Persons
My eDoc
Session History
Login
Name:
Password:
Documentation
Help
Support Wiki
Direct access to
document ID:


          Display Documents


Institute:
Collection:
Print in Citation style Print version     Display:
Sort by: Display records with Fulltext only
Entries: 1-6  
 Basket 
Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections
Editors: Farach-Colton, Martin
Authors: Boros, Endre; Elbassioni, Khaled; Gurvich, Vladimir; Khachiyan, Leonid
Place of Publication: Berlin, Germany
Publisher: Springer
Date of Publication (YYYY-MM-DD): 2004
Title of Proceedings: LATIN 2004: Theoretical Informatics, 6th Latin American Symposium
Start Page: 488
End Page: 498
Title of Series: Lecture Notes in Computer Science
Document Type: Conference-Paper
ID: 231179.0
Collective Tree Exploration
Editors: Farach-Colton, Martin
Authors: Fraigniaud, Pierre; Gasieniec, Leszek; Kowalski, Dariusz; Pelc, Andrzej
Place of Publication: Berlin, Germany
Publisher: Springer
Date of Publication (YYYY-MM-DD): 2004
Title of Proceedings: LATIN 2004: Theoretical informatics, 6th Latin American Symposium
Start Page: 141
End Page: 151
Title of Series: Lecture Notes in Computer Science
Document Type: Conference-Paper
ID: 231195.0
Collective Tree Exploration
Editors: Farach-Colton, Martin
Authors: Fraigniaud, Pierre; Gasieniec, Leszek; Kowalski, Dariusz; Pelc, Andrzej
Place of Publication: Berlin, Germany
Publisher: Springer
Date of Publication (YYYY-MM-DD): 2004
Title of Proceedings: LATIN 2004: Theoretical informatics, 6th Latin American Symposium
Start Page: 141
End Page: 151
Title of Series: Lecture Notes in Computer Science
Document Type: Conference-Paper
ID: 231993.0
Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections
Editors: Farach-Colton, Martin
Authors: Boros, Endre; Elbassioni, Khaled; Gurvich, Vladimir; Khachiyan, Leonid
Place of Publication: Berlin, Germany
Publisher: Springer
Date of Publication (YYYY-MM-DD): 2004
Title of Proceedings: LATIN 2004: Theoretical Informatics, 6th Latin American Symposium
Start Page: 488
End Page: 498
Title of Series: Lecture Notes in Computer Science
Document Type: Conference-Paper
ID: 232027.0
An O(n log n) algorithm for the maximum agreement subtree problem for binary trees
Authors: Cole, Richard; Farach-Colton, Martin; Hariharan, Ramesh; Przytycka, Teresa; Thorup, Mikkel
Date of Publication (YYYY-MM-DD): 2000
Title of Journal: SIAM Journal on Computing
Volume: 30
Start Page: 1385
End Page: 1404
Document Type: Article
ID: 202072.0
An O(n log n) algorithm for the maximum agreement subtree problem for binary trees
Authors: Cole, Richard; Farach-Colton, Martin; Hariharan, Ramesh; Przytycka, Teresa; Thorup, Mikkel
Date of Publication (YYYY-MM-DD): 2000
Title of Journal: SIAM Journal on Computing
Volume: 30
Issue / Number: 5
Start Page: 1385
End Page: 1404
Document Type: Article
ID: 518226.0
Entries: 1-6  
The scope and number of records on eDoc is subject to the collection policies defined by each institute - see "info" button in the collection browse view.