George F. Georgakopoulos

According to our database, George F. Georgakopoulos authored at least 14 papers between 1988 and 2012.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of four.

2012

PoweRGen: A power-law based generator of RDFS schemas.

Yannis Theoharis, George F. Georgakopoulos, Vassilis Christophides

Inf. Syst., 2012

2009

Nash equilibria in all-optical networks.

George F. Georgakopoulos, Dimitris J. Kavvadias, Leonidas G. Sioutis

Discret. Math., 2009

2008

Buffered cross-bar switches, revisited: design steps, proofs and simulations towards optimal rate and minimum buffer memory.

George F. Georgakopoulos

IEEE/ACM Trans. Netw., 2008

Chain-splay trees, or, how to achieve and prove loglogN-competitiveness by splaying.

George F. Georgakopoulos

Inf. Process. Lett., 2008

2007

MAX-DENSITY Revisited: a Generalization and a More Efficient Algorithm.

George F. Georgakopoulos, Kostas Politopoulos

Comput. J., 2007

On the Synthetic Generation of Semantic Web Schemas.

Yannis Theoharis, George F. Georgakopoulos, Vassilis Christophides

Proceedings of the Semantic Web, Ontologies and Databases, VLDB Workshop, 2007

2005

How to Splay for loglog N-Competitiveness.

George F. Georgakopoulos

Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

2004

Splay trees: a reweighing lemma and a proof of competitiveness vs. dynamic balanced trees.

George F. Georgakopoulos

J. Algorithms, 2004

Generalized Template Splay: A Basic Theory and Calculus.

George F. Georgakopoulos, David J. McClurkin

Comput. J., 2004

Nash equilibria as a fundamental issue concerning network-switches design.

George F. Georgakopoulos

Proceedings of IEEE International Conference on Communications, 2004

2001

Precedence Constrained Scheduling: A Case in P.

Kostas Politopoulos, George F. Georgakopoulos, Panayotis Tsanakas

Comput. J., 2001

Sphendamnoe: A Proof that k-Splay Fails to Achieve log_kN Behaviour.

David J. McClurkin, George F. Georgakopoulos

Proceedings of the Advances in Informatics, 8th Panhellenic Conference on Informatics, 2001

1999

General Splay: A Basic Theory and Calculus.

George F. Georgakopoulos, David J. McClurkin

Proceedings of the Algorithms and Computation, 10th International Symposium, 1999

1988

Probabilistic satisfiability.

George F. Georgakopoulos, Dimitris J. Kavvadias, Christos H. Papadimitriou

J. Complex., 1988