default search action
George F. Georgakopoulos
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
- [j9]Yannis Theoharis, George F. Georgakopoulos, Vassilis Christophides:
PoweRGen: A power-law based generator of RDFS schemas. Inf. Syst. 37(4): 306-319 (2012)
2000 – 2009
- 2009
- [j8]George F. Georgakopoulos, Dimitris J. Kavvadias, Leonidas G. Sioutis:
Nash equilibria in all-optical networks. Discret. Math. 309(13): 4332-4342 (2009) - 2008
- [j7]George F. Georgakopoulos:
Chain-splay trees, or, how to achieve and prove loglogN-competitiveness by splaying. Inf. Process. Lett. 106(1): 37-43 (2008) - [j6]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) - 2007
- [j5]George F. Georgakopoulos, Kostas Politopoulos:
MAX-DENSITY Revisited: a Generalization and a More Efficient Algorithm. Comput. J. 50(3): 348-356 (2007) - [c6]Yannis Theoharis, George F. Georgakopoulos, Vassilis Christophides:
On the Synthetic Generation of Semantic Web Schemas. SWDB-ODBIS 2007: 98-116 - 2005
- [c5]George F. Georgakopoulos:
How to Splay for loglog N-Competitiveness. WEA 2005: 570-579 - [c4]George F. Georgakopoulos, Dimitris J. Kavvadias, Leonidas G. Sioutis:
Nash Equilibria in All-Optical Networks. WINE 2005: 1033-1045 - 2004
- [j4]George F. Georgakopoulos, David J. McClurkin:
Generalized Template Splay: A Basic Theory and Calculus. Comput. J. 47(1): 10-19 (2004) - [j3]George F. Georgakopoulos:
Splay trees: a reweighing lemma and a proof of competitiveness vs. dynamic balanced trees. J. Algorithms 51(1): 64-76 (2004) - [c3]George F. Georgakopoulos:
Nash equilibria as a fundamental issue concerning network-switches design. ICC 2004: 1080-1084 - 2001
- [j2]Kostas Politopoulos, George F. Georgakopoulos, Panayotis Tsanakas:
Precedence Constrained Scheduling: A Case in P. Comput. J. 44(3): 163-173 (2001) - [c2]David J. McClurkin, George F. Georgakopoulos:
Sphendamnoe: A Proof that k-Splay Fails to Achieve logkN Behaviour. Panhellenic Conference on Informatics 2001: 480-496
1990 – 1999
- 1999
- [c1]George F. Georgakopoulos, David J. McClurkin:
General Splay: A Basic Theory and Calculus. ISAAC 1999: 4-17
1980 – 1989
- 1988
- [j1]George F. Georgakopoulos, Dimitris J. Kavvadias, Christos H. Papadimitriou:
Probabilistic satisfiability. J. Complex. 4(1): 1-11 (1988)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: