default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexis C. Kaporis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j18]Alexis C. Kaporis, Christos Makris
, Spyros Sioutas, Athanasios K. Tsakalidis, Kostas Tsichlas, Christos D. Zaroliagis:
Dynamic Interpolation Search revisited. Inf. Comput. 270 (2020)
2010 – 2019
- 2018
- [c18]Djamal Belazzougui, Alexis C. Kaporis, Paul G. Spirakis:
Random input helps searching predecessors. GASCom 2018: 106-115 - 2017
- [j17]Dimitris Fotakis, Alexis C. Kaporis, Thanasis Lianeas, Paul G. Spirakis:
Resolving Braess's Paradox in Random Networks. Algorithmica 78(3): 788-818 (2017) - 2016
- [r4]Alexis C. Kaporis, Paul (Pavlos) Spirakis:
Stackelberg Games: The Price of Optimum. Encyclopedia of Algorithms 2016: 2078-2083 - [r3]Alexis C. Kaporis, Lefteris M. Kirousis:
Thresholds of Random k-Sat. Encyclopedia of Algorithms 2016: 2236-2239 - 2014
- [j16]Dimitris Fotakis, Alexis C. Kaporis, Thanasis Lianeas, Paul G. Spirakis:
On the hardness of network design for bottleneck routing games. Theor. Comput. Sci. 521: 107-122 (2014) - [j15]Gerth Stølting Brodal, Alexis C. Kaporis, Apostolos N. Papadopoulos, Spyros Sioutas, Konstantinos Tsakalidis, Kostas Tsichlas:
Dynamic 3-sided planar range queries with expected doubly-logarithmic time. Theor. Comput. Sci. 526: 58-74 (2014) - 2013
- [j14]Alexis C. Kaporis, Christos Makris, Spyros Sioutas, Athanasios K. Tsakalidis, Kostas Tsichlas, Christos D. Zaroliagis:
Improved Bounds for Finger Search on a RAM. Algorithmica 66(2): 249-286 (2013) - [c17]Dimitris Fotakis, Alexis C. Kaporis, Thanasis Lianeas, Paul G. Spirakis:
Resolving Braess's Paradox in Random Networks. WINE 2013: 188-201 - 2012
- [j13]Dimitris Fotakis, Vasilis Gkatzelis, Alexis C. Kaporis, Paul G. Spirakis:
The Impact of Social Ignorance on Weighted Congestion Games. Theory Comput. Syst. 50(3): 559-578 (2012) - [j12]Dimitris Fotakis, Alexis C. Kaporis, Paul G. Spirakis:
Efficient methods for selfish network design. Theor. Comput. Sci. 448: 9-20 (2012) - [c16]Dimitris Fotakis, Alexis C. Kaporis, Thanasis Lianeas, Paul G. Spirakis:
On the Hardness of Network Design for Bottleneck Routing Games. SAGT 2012: 156-167 - [i5]Gerth Stølting Brodal, Alexis C. Kaporis, Apostolos N. Papadopoulos, Spyros Sioutas, Konstantinos Tsakalidis, Kostas Tsichlas:
Dynamic 3-sided Planar Range Queries with Expected Doubly Logarithmic Time. CoRR abs/1201.2702 (2012) - [i4]Dimitris Fotakis, Alexis C. Kaporis, Thanasis Lianeas, Paul G. Spirakis:
On the Hardness of Network Design for Bottleneck Routing Games. CoRR abs/1207.5212 (2012) - 2011
- [j11]Alexis C. Kaporis, Paul G. Spirakis:
Selfish splittable flows and NP-completeness. Comput. Sci. Rev. 5(3): 209-228 (2011) - [i3]Djamal Belazzougui, Alexis C. Kaporis, Paul G. Spirakis:
Random input helps searching predecessors. CoRR abs/1104.4353 (2011) - 2010
- [j10]Alexis C. Kaporis, Christos Makris, George Mavritsakis, Spyros Sioutas, Athanasios K. Tsakalidis, Kostas Tsichlas, Christos D. Zaroliagis:
ISB-tree: A new indexing scheme with efficient expected behaviour. J. Discrete Algorithms 8(4): 373-387 (2010) - [j9]Dimitris Fotakis, Alexis C. Kaporis, Paul G. Spirakis:
Atomic Congestion Games: Fast, Myopic and Concurrent. Theory Comput. Syst. 47(1): 38-59 (2010) - [c15]Alexis C. Kaporis, Apostolos N. Papadopoulos, Spyros Sioutas, Konstantinos Tsakalidis, Kostas Tsichlas:
Efficient processing of 3-sided range queries with probabilistic guarantees. ICDT 2010: 34-43
2000 – 2009
- 2009
- [j8]Josep Díaz, Alexis C. Kaporis, G. D. Kemkes, Lefteris M. Kirousis, Xavier Pérez-Giménez, Nicholas C. Wormald:
On the chromatic number of a random 5-regular graph. J. Graph Theory 61(3): 157-191 (2009) - [j7]Alexis C. Kaporis, Paul G. Spirakis:
The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions. Theor. Comput. Sci. 410(8-10): 745-755 (2009) - [c14]Dimitris Fotakis, Alexis C. Kaporis, Paul G. Spirakis:
Efficient Methods for Selfish Network Design. ICALP (2) 2009: 459-471 - [c13]Gerth Stølting Brodal, Alexis C. Kaporis, Spyros Sioutas, Konstantinos Tsakalidis, Kostas Tsichlas:
Dynamic 3-Sided Planar Range Queries with Expected Doubly Logarithmic Time. ISAAC 2009: 193-202 - [c12]Dimitris Fotakis, Vasilis Gkatzelis, Alexis C. Kaporis, Paul G. Spirakis:
The Impact of Social Ignorance on Weighted Congestion Games. WINE 2009: 316-327 - 2008
- [c11]Dimitris Fotakis, Alexis C. Kaporis, Paul G. Spirakis:
Atomic Congestion Games: Fast, Myopic and Concurrent. SAGT 2008: 121-132 - [c10]Dimitris Kalles, Alexis C. Kaporis, Paul G. Spirakis:
Myopic Distributed Protocols for Singleton and Independent-Resource Congestion Games. WEA 2008: 181-193 - [r2]Alexis C. Kaporis, Lefteris M. Kirousis:
Thresholds of Random k-Sat. Encyclopedia of Algorithms 2008 - [r1]Alexis C. Kaporis, Paul G. Spirakis:
Stackelberg Games: The Price of Optimum. Encyclopedia of Algorithms 2008 - [i2]Dimitris Kalles, Alexis C. Kaporis:
Emerge-Sort: Converging to Ordered Sequences by Simple Local Operators. CoRR abs/0812.1126 (2008) - 2007
- [j6]Alexis C. Kaporis, Lefteris M. Kirousis, Yannis C. Stamatiou, Malvina Vamvakari, Michele Zito:
The unsatisfiability threshold revisited. Discret. Appl. Math. 155(12): 1525-1538 (2007) - 2006
- [j5]Alexis C. Kaporis, Lefteris M. Kirousis, Efthimios G. Lalas:
The probabilistic analysis of a greedy satisfiability algorithm. Random Struct. Algorithms 28(4): 444-480 (2006) - [c9]Alexis C. Kaporis, Lefteris M. Kirousis, Elias C. Stavropoulos:
Approximating Almost All Instances of Max-Cut Within a Ratio Above the Håstad Threshold. ESA 2006: 432-443 - [c8]Alexis C. Kaporis, Christos Makris, Spyros Sioutas, Athanasios K. Tsakalidis, Kostas Tsichlas, Christos D. Zaroliagis:
Dynamic Interpolation Search Revisited. ICALP (1) 2006: 382-394 - [c7]Alexis C. Kaporis, Paul G. Spirakis:
The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions. SPAA 2006: 19-28 - [p1]Alexis C. Kaporis, Lefteris M. Kirousis, Yannis C. Stamatiou:
Proving Conditional Randomness using The Principle of Deferred Decisions. Computational Complexity and Statistical Physics 2006: 179-194 - 2005
- [c6]Josep Díaz, G. Grammatikopoulos, Alexis C. Kaporis, Lefteris M. Kirousis, Xavier Pérez-Giménez, Dionisios G. Sotiropoulos:
5-Regular Graphs are 3-Colorable with Positive Probability. ESA 2005: 215-225 - [c5]Alexis C. Kaporis, Christos Makris, George Mavritsakis, Spyros Sioutas, Athanasios K. Tsakalidis, Kostas Tsichlas, Christos D. Zaroliagis:
ISB-Tree: A New Indexing Scheme with Efficient Expected Behaviour. ISAAC 2005: 318-327 - [c4]Alexis C. Kaporis, Lefteris M. Kirousis, Efpraxia I. Politopoulou, Paul G. Spirakis:
Experimental Results for Stackelberg Scheduling Strategies. WEA 2005: 77-88 - [i1]Alexis C. Kaporis, Efpraxia I. Politopoulou, Paul G. Spirakis:
The Price of Optimum in Stackelberg Games. Electron. Colloquium Comput. Complex. TR05 (2005) - 2003
- [b1]Alexis C. Kaporis:
Οριακά φαινόμενα αλλαγής φάσης σε συνδυαστικά προβλήματα. University of Patras, Greece, 2003 - [j4]Alexis C. Kaporis, Lefteris M. Kirousis, Efthimios G. Lalas:
Selecting Complementary Pairs of Literals. Electron. Notes Discret. Math. 16: 47-70 (2003) - [c3]Alexis C. Kaporis, Christos Makris, Spyros Sioutas, Athanasios K. Tsakalidis, Kostas Tsichlas, Christos D. Zaroliagis:
Improved Bounds for Finger Search on a RAM. ESA 2003: 325-336 - 2002
- [c2]Alexis C. Kaporis, Lefteris M. Kirousis, Efthimios G. Lalas:
The Probabilistic Analysis of a Greedy Satisfiability Algorithm. ESA 2002: 574-585 - 2001
- [j3]Alexis C. Kaporis, Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Yannis C. Stamatiou, Elias C. Stavropoulos:
Locating Information with Uncertainty in Fully Interconnected Networks with Applications to World Wide Web Information Retrieval. Comput. J. 44(4): 221-229 (2001) - [j2]Alexis C. Kaporis, Lefteris M. Kirousis, Yannis C. Stamatiou, Malvina Vamvakari, Michele Zito:
The unsatisfiability threshold revisited. Electron. Notes Discret. Math. 9: 81-95 (2001) - [c1]Alexis C. Kaporis, Lefteris M. Kirousis, Yannis C. Stamatiou, Malvina Vamvakari, Michele Zito:
Coupon Collectors, q-Binomial Coefficients and the Unsatisfiability Threshold. ICTCS 2001: 328-338 - 2000
- [j1]Alexis C. Kaporis, Lefteris M. Kirousis, Yannis C. Stamatiou:
A Note on the Non-Colorability Threshold of a Random Graph. Electron. J. Comb. 7 (2000)
Coauthor Index
aka: Paul (Pavlos) Spirakis
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-10-07 22:18 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:
