summaryrefslogtreecommitdiff
path: root/Master/texmf-dist/bibtex/bib/beebe/texbook3.bib
diff options
context:
space:
mode:
Diffstat (limited to 'Master/texmf-dist/bibtex/bib/beebe/texbook3.bib')
-rw-r--r--Master/texmf-dist/bibtex/bib/beebe/texbook3.bib82
1 files changed, 70 insertions, 12 deletions
diff --git a/Master/texmf-dist/bibtex/bib/beebe/texbook3.bib b/Master/texmf-dist/bibtex/bib/beebe/texbook3.bib
index b0d0ef19300..85d2a4f42ee 100644
--- a/Master/texmf-dist/bibtex/bib/beebe/texbook3.bib
+++ b/Master/texmf-dist/bibtex/bib/beebe/texbook3.bib
@@ -5,9 +5,9 @@
%%% ====================================================================
%%% BibTeX-file{
%%% author = "Nelson H. F. Beebe",
-%%% version = "3.79",
+%%% version = "3.81",
%%% date = "07 December 2019",
-%%% time = "08:14:58 MDT",
+%%% time = "16:57:25 MST",
%%% filename = "texbook3.bib",
%%% address = "University of Utah
%%% Department of Mathematics, 110 LCB
@@ -17,7 +17,7 @@
%%% telephone = "+1 801 581 5254",
%%% FAX = "+1 801 581 4148",
%%% URL = "http://www.math.utah.edu/~beebe",
-%%% checksum = "49948 22517 101468 962508",
+%%% checksum = "05076 22575 101773 965621",
%%% email = "beebe at math.utah.edu, beebe at acm.org,
%%% beebe at computer.org (Internet)",
%%% codetable = "ISO/ASCII",
@@ -37,7 +37,7 @@
%%% covered in separate bibliographies
%%% (ep.bib, epodd.bib, and sgml.bib).
%%%
-%%% At version 3.79, the year coverage looks
+%%% At version 3.81, the year coverage looks
%%% like this:
%%%
%%% 1928 ( 1) 1959 ( 0) 1990 ( 54)
@@ -69,14 +69,14 @@
%%% 1954 ( 0) 1985 ( 35) 2016 ( 2)
%%% 1955 ( 0) 1986 ( 41) 2017 ( 3)
%%% 1956 ( 0) 1987 ( 49) 2018 ( 1)
-%%% 1957 ( 0) 1988 ( 50) 2019 ( 3)
+%%% 1957 ( 0) 1988 ( 50) 2019 ( 4)
%%% 1958 ( 0) 1989 ( 55)
%%% 19xx ( 2)
%%%
%%% Article: 217
%%% Book: 325
%%% Booklet: 12
-%%% InCollection: 13
+%%% InCollection: 14
%%% InProceedings: 125
%%% Manual: 16
%%% MastersThesis: 4
@@ -87,7 +87,7 @@
%%% TechReport: 60
%%% Unpublished: 2
%%%
-%%% Total entries: 841
+%%% Total entries: 842
%%%
%%% The ISBN and ISSN fields will be printed if
%%% the is-alpha.bst or is-plain.bst style
@@ -14129,6 +14129,20 @@
Type and type-founding --- Handbooks, manuals, etc.",
}
+@InCollection{Levin:2019:B,
+ author = "Roy Levin",
+ title = "Biography",
+ crossref = "Malkhi:2019:CWL",
+ pages = "131--170",
+ year = "2019",
+ DOI = "https://doi.org/10.1145/3335772.3335781",
+ bibdate = "Sat Dec 07 16:35:48 2019",
+ bibsource = "http://www.math.utah.edu/pub/tex/bib/texbook3.bib",
+ acknowledgement = ack-nhfb,
+ remark = "Pages 143--146 of this biography of Leslie Lamport
+ discuss his work on \LaTeX{}.",
+}
+
@Article{Levine:1990:LGR,
author = "Michael J. S. Levine",
title = "A {\LaTeX} Graphics Routine for drawing {Feynman}
@@ -14836,14 +14850,17 @@
@Book{Malkhi:2019:CWL,
author = "Dahlia Malkhi",
+ booktitle = "Concurrency: the Works of {Leslie Lamport}",
title = "Concurrency: the Works of {Leslie Lamport}",
publisher = "Morgan and Claypool Publishers",
+ address = "Williston, VT 05495 USA",
pages = "xx + 345",
year = "2019",
DOI = "https://doi.org/10.1145/3335772",
- ISBN = "1-4503-7271-6, 1-4503-7270-8, 1-4503-7273-2",
- ISBN-13 = "978-1-4503-7271-8, 978-1-4503-7270-1,
- 978-1-4503-7273-2",
+ ISBN = "1-4503-7271-6 (paperback), 1-4503-7270-8 (hardcover),
+ 1-4503-7273-2",
+ ISBN-13 = "978-1-4503-7271-8 (paperback), 978-1-4503-7270-1
+ (hardcover), 978-1-4503-7273-2",
LCCN = "????",
bibdate = "Fri Dec 6 19:17:41 MST 2019",
bibsource = "fsz3950.oclc.org:210/WorldCat;
@@ -14851,8 +14868,8 @@
http://www.math.utah.edu/pub/tex/bib/texbook3.bib",
URL = "https://www.morganclaypoolpublishers.com/catalog_Orig/product_info.php?cPath=24&products_id=1468",
acknowledgement = ack-nhfb,
- tableofcontents = "Part I: Technical Perspectives on Lamport's Work
- \\
+ shorttableofcontents = "Part I: Technical Perspectives on Lamport's
+ Work \\
1: Shared Memory and the Bakery Algorithm \\
2: The Notions of Time and Global State in a
Distributed System \\
@@ -14873,6 +14890,47 @@
The Mutual Exclusion Problem: Part II --- Statement and
Solutions \\
The Part-Time Parliament",
+ tableofcontents = "Introduction / Dahlia Malkhi, Idit Keidar /
+ doi:10.1145/3335772.3335774 / 1--12 \\
+ The computer science of concurrency: the early years /
+ Leslie Lamport / doi:10.1145/3335772.3335775 / 13--26
+ \\
+ Shared memory and the Bakery algorithm / Hagit Attiya,
+ Jennifer L. Welch / doi:10.1145/3335772.3335776 /
+ 27--46 \\
+ The notions of time and global state in a distributed
+ system / Karolos Antoniadis, Rachid Guerraoui /
+ doi:10.1145/3335772.3335777 / 47--65 \\
+ Byzantine faults / Christian Cachin /
+ doi:10.1145/3335772.3335778 / 67--81 \\
+ State machine replication with benign failures /
+ Rubbert van Renesse / doi:10.1145/3335772.3335779 /
+ 83--102 \\
+ Formal specification and verification / Stephan Merz /
+ doi:10.1145/3335772.3335780 / 103--129 \\
+ Biography / Roy Levin / doi:10.1145/3335772.3335781 /
+ 131--170 \\
+ A new solution of Dijkstra's concurrent programming
+ problem / Leslie Lamport / doi:10.1145/3335772.3335782
+ / 171--178 \\
+ Time, clocks, and the ordering of events in a
+ distributed system / Leslie Lamport /
+ doi:10.1145/3335772.3335934 / 179--196 \\
+ How to make a multiprocessor computer that correctly
+ executes multiprocess programs / Leslie Lamport /
+ doi:10.1145/3335772.3335935 / 197--201 \\
+ The Byzantine generals problem / Leslie Lamport, Robert
+ Shostak, Marshall Pease / doi:10.1145/3335772.3335936 /
+ 203--226 \\
+ The mutual exclusion problem: part I --- a theory of
+ interprocess / communication / Leslie Lamport /
+ doi:10.1145/3335772.3335937 / 227--245 \\
+ The mutual exclusion problem: part II --- statement and
+ solutions / Leslie Lamport /
+ doi:10.1145/3335772.3335938 / 247--276 \\
+ The part-time parliament / Leslie Lamport /
+ doi:10.1145/3335772.3335939 / 277--317 \\
+ References / doi:10.1145/3335772.3335940 / 319--333",
}
@Article{Mamrak:1993:BAD,