skip to content
On the use of Markov processes in one-server waiting-time problems and renewal theory Preview this item
ClosePreview this item
Checking...

On the use of Markov processes in one-server waiting-time problems and renewal theory

Author: Johannes Theodorus Runnenburg
Publisher: [Amsterdam] : Runnenburg, 1960.
Dissertation: Universiteit van Amsterdam
Edition/Format:   Thesis/dissertation : Thesis/dissertation : EnglishView all editions and formats
Rating:

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

Subjects
More like this

Find a copy in the library

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

Details

Additional Physical Format: Online version:
Runnenburg, Johannes Theodorus.
On the use of Markov processes in one-server waiting-time problems and renewal theory.
[Amsterdam] : Runnenburg, 1960
(OCoLC)622907297
Material Type: Thesis/dissertation
Document Type: Book
All Authors / Contributors: Johannes Theodorus Runnenburg
OCLC Number: 4183577
Notes: Summary in Dutch.
Description: 139 pages ; 24 cm
Responsibility: Johannes Theodorus Runnenburg.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.

Similar Items

Related Subjects:(2)

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/4183577> # On the use of Markov processes in one-server waiting-time problems and renewal theory
    a schema:Book, bgn:Thesis, schema:CreativeWork ;
   bgn:inSupportOf "" ;
   library:oclcnum "4183577" ;
   library:placeOfPublication <http://id.loc.gov/vocabulary/countries/ne> ;
   library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/3473789#Place/amsterdam> ; # Amsterdam
   schema:about <http://id.worldcat.org/fast/1085713> ; # Queuing theory
   schema:about <http://id.worldcat.org/fast/1010347> ; # Markov processes
   schema:creator <http://viaf.org/viaf/285113963> ; # Johannes Theodorus Runnenburg
   schema:datePublished "1960" ;
   schema:exampleOfWork <http://worldcat.org/entity/work/id/3473789> ;
   schema:inLanguage "en" ;
   schema:isSimilarTo <http://www.worldcat.org/oclc/622907297> ;
   schema:name "On the use of Markov processes in one-server waiting-time problems and renewal theory"@en ;
   schema:productID "4183577" ;
   schema:publication <http://www.worldcat.org/title/-/oclc/4183577#PublicationEvent/amsterdam_runnenburg_1960> ;
   schema:publisher <http://experiment.worldcat.org/entity/work/data/3473789#Agent/runnenburg> ; # Runnenburg
   wdrs:describedby <http://www.worldcat.org/title/-/oclc/4183577> ;
    .


Related Entities

<http://id.worldcat.org/fast/1010347> # Markov processes
    a schema:Intangible ;
   schema:name "Markov processes"@en ;
    .

<http://id.worldcat.org/fast/1085713> # Queuing theory
    a schema:Intangible ;
   schema:name "Queuing theory"@en ;
    .

<http://viaf.org/viaf/285113963> # Johannes Theodorus Runnenburg
    a schema:Person ;
   schema:familyName "Runnenburg" ;
   schema:givenName "Johannes Theodorus" ;
   schema:name "Johannes Theodorus Runnenburg" ;
    .

<http://www.worldcat.org/oclc/622907297>
    a schema:CreativeWork ;
   rdfs:label "On the use of Markov processes in one-server waiting-time problems and renewal theory." ;
   schema:description "Online version:" ;
   schema:isSimilarTo <http://www.worldcat.org/oclc/4183577> ; # On the use of Markov processes in one-server waiting-time problems and renewal theory
    .

<http://www.worldcat.org/title/-/oclc/4183577>
    a genont:InformationResource, genont:ContentTypeGenericResource ;
   schema:about <http://www.worldcat.org/oclc/4183577> ; # On the use of Markov processes in one-server waiting-time problems and renewal theory
   schema:dateModified "2018-03-12" ;
   void:inDataset <http://purl.oclc.org/dataset/WorldCat> ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

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