| 2008 |
|---|
| 11 | EE | George F. Georgakopoulos:
Buffered cross-bar switches, revisited: design steps, proofs and simulations towards optimal rate and minimum buffer memory.
IEEE/ACM Trans. Netw. 16(6): 1340-1351 (2008) |
| 10 | EE | George F. Georgakopoulos:
Chain-splay trees, or, how to achieve and prove loglogN-competitiveness by splaying.
Inf. Process. Lett. 106(1): 37-43 (2008) |
| 2007 |
|---|
| 9 | EE | George F. Georgakopoulos,
Kostas Politopoulos:
MAX-DENSITY Revisited: a Generalization and a More Efficient Algorithm.
Comput. J. 50(3): 348-356 (2007) |
| 2005 |
|---|
| 8 | EE | George F. Georgakopoulos:
How to Splay for loglog N-Competitiveness.
WEA 2005: 570-579 |
| 7 | EE | George F. Georgakopoulos,
Dimitris J. Kavvadias,
Leonidas G. Sioutis:
Nash Equilibria in All-Optical Networks.
WINE 2005: 1033-1045 |
| 2004 |
|---|
| 6 | EE | George F. Georgakopoulos,
David J. McClurkin:
Generalized Template Splay: A Basic Theory and Calculus.
Comput. J. 47(1): 10-19 (2004) |
| 5 | EE | George F. Georgakopoulos:
Splay trees: a reweighing lemma and a proof of competitiveness vs. dynamic balanced trees.
J. Algorithms 51(1): 64-76 (2004) |
| 2001 |
|---|
| 4 | EE | David J. McClurkin,
George F. Georgakopoulos:
Sphendamnoe: A Proof that k-Splay Fails to Achieve logkN Behaviour.
Panhellenic Conference on Informatics 2001: 480-496 |
| 3 | EE | Kostas Politopoulos,
George F. Georgakopoulos,
Panayotis Tsanakas:
Precedence Constrained Scheduling: A Case in P.
Comput. J. 44(3): 163-173 (2001) |
| 1999 |
|---|
| 2 | EE | George F. Georgakopoulos,
David J. McClurkin:
General Splay: A Basic Theory and Calculus.
ISAAC 1999: 4-17 |
| 1988 |
|---|
| 1 | EE | George F. Georgakopoulos,
Dimitris J. Kavvadias,
Christos H. Papadimitriou:
Probabilistic satisfiability.
J. Complexity 4(1): 1-11 (1988) |
