( en | de | ru )

 

Disambiguation of "Georgakopoulos, George F."

Author of the publication

copydeleteadd this publication to your clipboard
On the Synthetic Generation of Semantic Web Schemas.

, , and . SWDB-ODBIS, volume 5005 of Lecture Notes in Computer Science, page 98-116. Springer, (2007)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Angelos Georgakopoulos

Phrixos Georgakopoulos

Konstantin Georgakopoulos

Theoharis Georgakopoulos

Eleftherios Georgakopoulos

 

Other publications of authors with the same name

Chain-splay trees, or, how to achieve and prove loglogN-competitiveness by splaying.. Inf. Process. Lett., 106 (1): 37-43 (2008)How to Splay for loglog N-Competitiveness.. WEA, volume 3503 of Lecture Notes in Computer Science, page 570-579. Springer, (2005)On the Synthetic Generation of Semantic Web Schemas., , and . SWDB-ODBIS, volume 5005 of Lecture Notes in Computer Science, page 98-116. Springer, (2007)Splay trees: a reweighing lemma and a proof of competitiveness vs. dynamic balanced trees.. J. Algorithms, 51 (1): 64-76 (2004)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)Precedence Constrained Scheduling: A Case in P., , and . Comput. J., 44 (3): 163-173 (2001)Generalized Template Splay: A Basic Theory and Calculus., and . Comput. J., 47 (1): 10-19 (2004)Nash equilibria in all-optical networks., , and . Discret. Math., 309 (13): 4332-4342 (2009)MAX-DENSITY Revisited: a Generalization and a More Efficient Algorithm., and . Comput. J., 50 (3): 348-356 (2007)General Splay: A Basic Theory and Calculus., and . ISAAC, volume 1741 of Lecture Notes in Computer Science, page 4-17. Springer, (1999)