English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Introducing Quasirandomness to Computer Science

Doerr, B. (2009). Introducing Quasirandomness to Computer Science. In Efficient Algorithms (pp. 99-111). doi:10.1007/978-3-642-03456-5_6.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Doerr, Benjamin1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2010-01-2520092009
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: Peer
 Identifiers: eDoc: 518264
DOI: 10.1007/978-3-642-03456-5_6
URI: http://www.springerlink.com/content/p826621w45727656/fulltext.pdf
Other: Local-ID: C1256428004B93B8-BA97F20EE9C762E3C12576B30031DEC6-Doerr2009
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Efficient Algorithms
  Subtitle : Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday, Pt. I
Source Genre: Book
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 99 - 111 Identifier: ISBN: 978-3-642-03455-8

Source 2

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