Show simple item record

A process-calculus analysis of concurrent operations on B-trees

dc.contributor.authorPhilippou, Annaen
dc.contributor.authorWalker, D.en
dc.creatorPhilippou, Annaen
dc.creatorWalker, D.en
dc.date.accessioned2019-11-13T10:42:00Z
dc.date.available2019-11-13T10:42:00Z
dc.date.issued2001
dc.identifier.urihttp://gnosis.library.ucy.ac.cy/handle/7/54846
dc.description.abstractA general theory of interactive systems with changing structure, the π-calculus, is used to study concurrent operations on a variant of the B-tree. An improved algorithm for compression of the data structure is given. Some general results on partially confluent processes and on client-server systems, couched in the π-calculus, are presented. © 2001 Academic Press.en
dc.sourceJournal of Computer and System Sciencesen
dc.source.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-0035250704&doi=10.1006%2fjcss.2000.1721&partnerID=40&md5=1e33c0a139c3e18a3c4ba2ce749c5f0e
dc.subjectπ-calculusel
dc.subjectAlgorithmsen
dc.subjectData reductionen
dc.subjectData compressionen
dc.subjectConcurrent engineeringen
dc.subjectInteractive computer systemsen
dc.subjectData structuresen
dc.subjectComputer systems programmingen
dc.subjectMobilityen
dc.subjectConcurrencyen
dc.subjectPartial confluenceen
dc.subjectProcess-calculus analysisen
dc.titleA process-calculus analysis of concurrent operations on B-treesen
dc.typeinfo:eu-repo/semantics/article
dc.identifier.doi10.1006/jcss.2000.1721
dc.description.volume62
dc.description.issue1
dc.description.startingpage73
dc.description.endingpage122
dc.author.faculty002 Σχολή Θετικών και Εφαρμοσμένων Επιστημών / Faculty of Pure and Applied Sciences
dc.author.departmentΤμήμα Πληροφορικής / Department of Computer Science
dc.type.uhtypeArticleen
dc.description.notes<p>Cited By :2</p>en
dc.source.abbreviationJ.Comput.Syst.Sci.en


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record