George F. Georgakopoulos

Publication Activity (10 Years)

Years Active: 1988-2012
Publications (10 Years): 0

Top Topics

Long Range Correlations

Semantic Web Data

Top Venues

Publications

Yannis Theoharis, George F. Georgakopoulos, Vassilis Christophides
PoweRGen: A power-law based generator of RDFS schemas. Inf. Syst. 37 (4) (2012)
George F. Georgakopoulos, Dimitris J. Kavvadias, Leonidas G. Sioutis
Nash equilibria in all-optical networks. Discret. Math. 309 (13) (2009)
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) (2008)
George F. Georgakopoulos
Chain-splay trees, or, how to achieve and prove loglogN-competitiveness by splaying. Inf. Process. Lett. 106 (1) (2008)
Yannis Theoharis, George F. Georgakopoulos, Vassilis Christophides
On the Synthetic Generation of Semantic Web Schemas. SWDB-ODBIS (2007)
George F. Georgakopoulos, Kostas Politopoulos
MAX-DENSITY Revisited: a Generalization and a More Efficient Algorithm. Comput. J. 50 (3) (2007)
George F. Georgakopoulos
How to Splay for loglog N-Competitiveness. WEA (2005)
George F. Georgakopoulos, Dimitris J. Kavvadias, Leonidas G. Sioutis
Nash Equilibria in All-Optical Networks. WINE (2005)
George F. Georgakopoulos, David J. McClurkin
Generalized Template Splay: A Basic Theory and Calculus. Comput. J. 47 (1) (2004)
George F. Georgakopoulos
Nash equilibria as a fundamental issue concerning network-switches design. ICC (2004)
George F. Georgakopoulos
Splay trees: a reweighing lemma and a proof of competitiveness vs. dynamic balanced trees. J. Algorithms 51 (1) (2004)
David J. McClurkin, George F. Georgakopoulos
N Behaviour. Panhellenic Conference on Informatics (2001)
Kostas Politopoulos, George F. Georgakopoulos, Panayotis Tsanakas
Precedence Constrained Scheduling: A Case in P. Comput. J. 44 (3) (2001)
George F. Georgakopoulos, David J. McClurkin
General Splay: A Basic Theory and Calculus. ISAAC (1999)
George F. Georgakopoulos, Dimitris J. Kavvadias, Christos H. Papadimitriou
Probabilistic satisfiability. J. Complex. 4 (1) (1988)