English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 DetailsSummary
  On the complexity of computing evolutionary trees

Gasieniec, L., Jansson, J., Lingas, A., & Östlin, A. (1997). On the complexity of computing evolutionary trees. In T. Jiang, & D. T. Lee (Eds.), Proceedings of the 3rd International Conference on Computing and Combinatorics (COCOON-97) (pp. 134-145). Berlin: Springer.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-3960-7 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-3962-3
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Gasieniec, Leszek1, Author           
Jansson, Jesper, Author
Lingas, Andrzej, Author
Östlin, Anna, Author
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2010-03-021997
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 517917
Other: Local-ID: C1256428004B93B8-D84B4594C78C20C2C12565D800423264-GasienicJanssonLingasOestlin1997
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Shanghai, China
Start-/End Date: -

Legal Case

show

Project information

show

Source 1

show
hide
Title: Proceedings of the 3rd International Conference on Computing and Combinatorics (COCOON-97)
Source Genre: Proceedings
 Creator(s):
Jiang, Tao, Editor
Lee, D. T., Editor
Affiliations:
-
Publ. Info: Berlin : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 134 - 145 Identifier: -

Source 2

show
hide
Title: Lecture Notes in Computer Science
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 1276 Sequence Number: - Start / End Page: - Identifier: -