List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Average case analysis of fully dynamic connectivity for directed graphs Graph-Theoretic Concepts in Computer Science | 2024-01-05 | Paper |
| Parallel dictionaries with local rules on AVL and brother trees Information Processing Letters | 2016-06-09 | Paper |
| Fringe analysis of synchronized parallel insertion algorithms in 2--3 trees. Theoretical Computer Science | 2003-05-25 | Paper |
| scientific article; zbMATH DE number 1760035 (Why is no real title available?) | 2002-11-06 | Paper |
| Skip trees, an alternative data structure to skip lists in a concurrent approach RAIRO - Theoretical Informatics and Applications | 1998-06-11 | Paper |
| A design of a parallel dictionary using skip lists Theoretical Computer Science | 1997-02-27 | Paper |
| Dynamic behaviour in updating process over BST of size two with probabilistic deletion algorithms Information Processing Letters | 1992-06-26 | Paper |
Research outcomes over time
This page was built for person: Xavier Messeguer
