skip to content
Advances in generating high repetition rate EUV frequency combs Preview this item
ClosePreview this item
Checking...

Advances in generating high repetition rate EUV frequency combs

Author: Andreas Vernaleken; Theodor W Hänsch
Publisher: München Universitätsbibliothek der Ludwig-Maximilians-Universität 2013
Dissertation: München, Ludwig-Maximilians-Universität, Diss., 2013
Edition/Format:   Thesis/dissertation : Document : Thesis/dissertation : eBook   Computer File : English
Rating:

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

Find a copy online

Links to this item

Find a copy in the library

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

Details

Material Type: Document, Thesis/dissertation, Internet resource
Document Type: Internet Resource, Computer File
All Authors / Contributors: Andreas Vernaleken; Theodor W Hänsch
OCLC Number: 902890396
Description: Online-Ressource
Responsibility: Andreas Vernaleken. Betreuer: Theodor W. Hänsch

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


Primary Entity

<http://www.worldcat.org/oclc/902890396> # Advances in generating high repetition rate EUV frequency combs
    a schema:Book, bgn:Thesis, schema:CreativeWork, schema:MediaObject, pto:Web_document ;
    bgn:inSupportOf "München, Ludwig-Maximilians-Universität, Diss., 2013" ;
    library:oclcnum "902890396" ;
    library:placeOfPublication <http://id.loc.gov/vocabulary/countries/gw> ;
    library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/2286466956#Place/munchen> ; # München
    schema:about <http://dewey.info/class/530/> ;
    schema:author <http://experiment.worldcat.org/entity/work/data/2286466956#Person/vernaleken_andreas> ; # Andreas Vernaleken
    schema:contributor <http://experiment.worldcat.org/entity/work/data/2286466956#Person/hansch_theodor_w> ; # Theodor W. Hänsch
    schema:datePublished "2013" ;
    schema:exampleOfWork <http://worldcat.org/entity/work/id/2286466956> ;
    schema:inLanguage "en" ;
    schema:name "Advances in generating high repetition rate EUV frequency combs" ;
    schema:productID "902890396" ;
    schema:publication <http://www.worldcat.org/title/-/oclc/902890396#PublicationEvent/munchenuniversitatsbibliothek_der_ludwig_maximilians_universitat2013> ;
    schema:publisher <http://experiment.worldcat.org/entity/work/data/2286466956#Agent/universitatsbibliothek_der_ludwig_maximilians_universitat> ; # Universitätsbibliothek der Ludwig-Maximilians-Universität
    schema:url <http://d-nb.info/1065610165/34> ;
    schema:url <http://edoc.ub.uni-muenchen.de/17751/> ;
    schema:url <http://nbn-resolving.de/urn:nbn:de:bvb:19-177511> ;
    umbel:isLike <http://d-nb.info/1065610165> ;
    wdrs:describedby <http://www.worldcat.org/title/-/oclc/902890396> ;
    .


Related Entities

<http://edoc.ub.uni-muenchen.de/17751/>
    rdfs:comment "kostenfrei" ;
    .

<http://experiment.worldcat.org/entity/work/data/2286466956#Agent/universitatsbibliothek_der_ludwig_maximilians_universitat> # Universitätsbibliothek der Ludwig-Maximilians-Universität
    a bgn:Agent ;
    schema:name "Universitätsbibliothek der Ludwig-Maximilians-Universität" ;
    .

<http://experiment.worldcat.org/entity/work/data/2286466956#Person/hansch_theodor_w> # Theodor W. Hänsch
    a schema:Person ;
    schema:familyName "Hänsch" ;
    schema:givenName "Theodor W." ;
    schema:name "Theodor W. Hänsch" ;
    schema:sameAs <http://d-nb.info/gnd/1028236417> ;
    .

<http://experiment.worldcat.org/entity/work/data/2286466956#Person/vernaleken_andreas> # Andreas Vernaleken
    a schema:Person ;
    schema:familyName "Vernaleken" ;
    schema:givenName "Andreas" ;
    schema:name "Andreas Vernaleken" ;
    schema:sameAs <http://d-nb.info/gnd/1065666403> ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

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