|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 865 occurrences of 426 keywords
|
|
|
Results
Found 709 publication records. Showing 709 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
10 | Dan Duchamp |
Analysis of Transaction Management Performance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSP ![In: Proceedings of the Twelfth ACM Symposium on Operating System Principles, SOSP 1989, The Wigwam, Litchfield Park, Arizona, USA, December 3-6, 1989, pp. 177-190, 1989, ACM, 0-89791-338-8. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
10 | Peter Wegner |
Granularity of modules in object-based concurrent systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OOPSLA/ECOOP Workshop on Object-based Concurrent Programming ![In: Proceedings of the 1988 ACM SIGPLAN Workshop on Object-based Concurrent Programming, OOPSLA/ECOOP Workshop on Object-based Concurrent Programming 1988, San Diego, CA, USA, September 26-27, 1988, pp. 46-49, 1988, ACM, 978-0-89791-304-1. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
10 | Roger L. Haskin, Yoni Malachi, Wayne Sawdon, Gregory Chan |
Recovery Management in QuickSilver. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Syst. ![In: ACM Trans. Comput. Syst. 6(1), pp. 82-108, 1988. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
QuickSilver |
10 | Abha Moitra, S. Sitharama Iyengar, Farokh B. Bastani, I-Ling Yen |
Multilevel Data Structures: Models and Performance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 14(6), pp. 858-867, 1988. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
multilevel data structure, data structures, concurrency, software reliability, program verification, program verification, programming theory, correctness proof, data organization, maintenance processes |
10 | Ouri Wolfson |
The Overhead of Locking (and Commit) Protocols in Distributed Databases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Database Syst. ![In: ACM Trans. Database Syst. 12(3), pp. 453-471, 1987. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
10 | Irene Greif, Robert Seliger, William E. Weihl |
Atomic Data Abstractions in a Distributed Collaborative Editing System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Conference Record of the Thirteenth Annual ACM Symposium on Principles of Programming Languages, St. Petersburg Beach, Florida, USA, January 1986, pp. 160-172, 1986, ACM Press. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
10 | Leslie Lamport |
Reasoning About Nonatomic Operations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Conference Record of the Tenth Annual ACM Symposium on Principles of Programming Languages, Austin, Texas, USA, January 1983, pp. 28-37, 1983, ACM Press, 0-89791-090-7. The full citation details ...](Pics/full.jpeg) |
1983 |
DBLP DOI BibTeX RDF |
|
10 | Henry F. Korth, Ravi Krishnamurthy, Anil Nigam, John T. Robinson |
A Framework for Understanding Distributed (Deadlock Detection) Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: Proceedings of the Second ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, March 21-23, 1983, Colony Square Hotel, Atlanta, Georgia, USA, pp. 192-202, 1983, ACM, 0-89791-097-4. The full citation details ...](Pics/full.jpeg) |
1983 |
DBLP DOI BibTeX RDF |
|
10 | Herbert Kuss |
On Totally Ordering Checkpoints in Distributed Data Bases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: Proceedings of the 1982 ACM SIGMOD International Conference on Management of Data, Orlando, Florida, USA, June 2-4, 1982., pp. 174, 293-302, 1982, ACM Press, 978-0-89791-073-6. The full citation details ...](Pics/full.jpeg) |
1982 |
DBLP DOI BibTeX RDF |
|
Displaying result #701 - #709 of 709 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8] |
|