George F. Georgakopoulos

Available identifiers

zbMath Open georgakopoulos.george-fMaRDI QIDQ963329

List of research outcomes

Publication	Date of Publication	Type
Chain-splay trees, or, how to achieve and prove \(\log \log N\)-competitiveness by splaying	2010-04-19	Paper
Nash equilibria in all-optical networks	2009-12-10	Paper
Experimental and Efficient Algorithms	2005-11-30	Paper
Generalized Template Splay: A Basic Theory and Calculus	2004-11-19	Paper
Splay trees: a reweighing lemma and a proof of competitiveness vs. dynamic balanced trees	2004-10-01	Paper
https://portal.mardi4nfdi.de/entity/Q4415066	2003-07-28	Paper
Precedence constrained scheduling: A case in \({\mathbf P}\)	2002-05-05	Paper
https://portal.mardi4nfdi.de/entity/Q4511214	2000-10-30	Paper
An approach to parallel algorithm design	1993-06-29	Paper
The Banker's problem with precedences	1990-01-01	Paper
Probabilistic satisfiability	1988-01-01	Paper
The 1-steiner tree problem	1987-01-01	Paper

Research outcomes over time

This page was built for person: George F. Georgakopoulos