Programming Techniques: An algorithm for the probability of the union of a large number of events.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/cacm/Miller68
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/cacm/Miller68
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/G._D._Miller
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1145%2F364063.364084
>
foaf:
homepage
<
https://doi.org/10.1145/364063.364084
>
dc:
identifier
DBLP journals/cacm/Miller68
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1145%2F364063.364084
(xsd:string)
dcterms:
issued
1968
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/cacm
>
rdfs:
label
Programming Techniques: An algorithm for the probability of the union of a large number of events.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/G._D._Miller
>
swrc:
number
9
(xsd:string)
swrc:
pages
630-631
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/cacm/Miller68/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/cacm/Miller68
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/cacm/cacm11.html#Miller68
>
rdfs:
seeAlso
<
https://doi.org/10.1145/364063.364084
>
dc:
subject
algorithm, mutually exclusive events, optimum, probability, set union, storage vs. time compromise
(xsd:string)
dc:
title
Programming Techniques: An algorithm for the probability of the union of a large number of events.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
11
(xsd:string)