Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVissarion Fisikopoulos
Person information
- affiliation: Oracle, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i17]Cyril Bachelard, Apostolos Chalkis, Vissarion Fisikopoulos, Elias P. Tsigaridas:
Randomized Control in Performance Analysis and Empirical Asset Pricing. CoRR abs/2403.00009 (2024)- 2023
- [j10]Ludovic Calès
, Apostolos Chalkis, Ioannis Z. Emiris, Vissarion Fisikopoulos:
Practical volume approximation of high-dimensional convex bodies, applied to modeling portfolio dependencies and financial crises. Comput. Geom. 109: 101916 (2023) - [j9]Apostolos Chalkis, Ioannis Z. Emiris, Vissarion Fisikopoulos:
A Practical Algorithm for Volume Estimation based on Billiard Trajectories and Simulated Annealing. ACM J. Exp. Algorithmics 28: 1.3:1-1.3:34 (2023) - [j8]Apostolos Chalkis, Vissarion Fisikopoulos, Marios Papachristou, Elias P. Tsigaridas:
Truncated Log-concave Sampling for Convex Bodies with Reflective Hamiltonian Monte Carlo. ACM Trans. Math. Softw. 49(2): 16:1-16:25 (2023) - [c12]Cyril Bachelard, Apostolos Chalkis, Vissarion Fisikopoulos, Elias P. Tsigaridas:
Randomized geometric tools for anomaly detection in stock markets. AISTATS 2023: 9400-9416 - 2022
- [i16]Cyril Bachelard, Apostolos Chalkis, Vissarion Fisikopoulos, Elias P. Tsigaridas:
Randomized geometric tools for anomaly detection in stock markets. CoRR abs/2205.03852 (2022) - [i15]Tinko Bartels, Vissarion Fisikopoulos, Martin Weiser:
Fast Floating-Point Filters for Robust Predicates. CoRR abs/2208.00497 (2022) - 2021
- [j7]Apostolos Chalkis, Vissarion Fisikopoulos:
volesti: Volume Approximation and Sampling for Convex Polytopes in R. R J. 13(2): 561 (2021) - [c11]Apostolos Chalkis, Vissarion Fisikopoulos, Elias P. Tsigaridas, Haris Zafeiropoulos:
Geometric Algorithms for Sampling the Flux Space of Metabolic Networks. SoCG 2021: 21:1-21:16 - [i14]Apostolos Chalkis, Vissarion Fisikopoulos, Marios Papachristou, Elias P. Tsigaridas:
Truncated Log-concave Sampling with Reflective Hamiltonian Monte Carlo. CoRR abs/2102.13068 (2021) - 2020
- [j6]Apostolos Chalkis, Vissarion Fisikopoulos, Panagiotis Repouskos, Elias P. Tsigaridas:
Sampling the feasible sets of SDPs and volume approximation. ACM Commun. Comput. Algebra 54(3): 114-118 (2020) - [c10]Apostolos Chalkis, Ioannis Z. Emiris, Vissarion Fisikopoulos:
Practical Volume Estimation of Zonotopes by a New Annealing Schedule for Cooling Convex Bodies. ICMS 2020: 212-221 - [i13]Apostolos Chalkis, Vissarion Fisikopoulos:
volesti: Volume Approximation and Sampling for Convex Polytopes in R. CoRR abs/2007.01578 (2020) - [i12]Apostolos Chalkis, Ioannis Z. Emiris, Vissarion Fisikopoulos, Panagiotis Repouskos, Elias P. Tsigaridas:
Efficient Sampling from Feasible Sets of SDPs and Volume Approximation. CoRR abs/2010.03817 (2020) - [i11]Apostolos Chalkis, Vissarion Fisikopoulos, Elias P. Tsigaridas, Haris Zafeiropoulos:
Geometric algorithms for sampling the flux space of metabolic networks. CoRR abs/2012.05503 (2020)
2010 – 2019
- 2019
- [j5]Adam Bohn, Yuri Faenza, Samuel Fiorini, Vissarion Fisikopoulos, Marco Macchia, Kanstantsin Pashkovich:
Enumeration of 2-level polytopes. Math. Program. Comput. 11(1): 173-210 (2019) - [i10]Apostolos Chalkis, Ioannis Z. Emiris, Vissarion Fisikopoulos:
Practical Volume Estimation by a New Annealing Schedule for Cooling Convex Bodies. CoRR abs/1905.05494 (2019) - 2018
- [j4]Ioannis Z. Emiris, Vissarion Fisikopoulos:
Practical Polytope Volume Approximation. ACM Trans. Math. Softw. 44(4): 38:1-38:21 (2018) - [c9]Ludovic Calès, Apostolos Chalkis, Ioannis Z. Emiris, Vissarion Fisikopoulos:
Practical Volume Computation of Structured Convex Bodies, and an Application to Modeling Portfolio Dependencies and Financial Crises. SoCG 2018: 19:1-19:15 - [c8]Evangelos Anagnostopoulos, Ioannis Z. Emiris, Vissarion Fisikopoulos:
Polytope Membership in High Dimension. ISCO 2018: 39-51 - [i9]Ludovic Calès, Apostolos Chalkis, Ioannis Z. Emiris, Vissarion Fisikopoulos:
Practical volume computation of structured convex bodies, and an application to modeling portfolio dependencies and financial crises. CoRR abs/1803.05861 (2018) - [i8]Evangelos Anagnostopoulos, Ioannis Z. Emiris, Vissarion Fisikopoulos:
Algorithms for Deciding Membership in Polytopes of General Dimension. CoRR abs/1804.11295 (2018) - 2017
- [c7]Vissarion Fisikopoulos, Zafeirakis Zafeirakopoulos:
Experimental Study of the Ehrhart Interpolation Polytope. MACIS 2017: 320-324 - [i7]Adam Bohn, Yuri Faenza, Samuel Fiorini, Vissarion Fisikopoulos, Marco Macchia, Kanstantsin Pashkovich:
Enumeration of 2-level polytopes. CoRR abs/1703.01943 (2017) - 2016
- [j3]Vissarion Fisikopoulos, Luis Mariano Peñaranda:
Faster geometric algorithms via dynamic determinant computation. Comput. Geom. 54: 1-16 (2016) - [j2]Ioannis Z. Emiris, Vissarion Fisikopoulos, Bernd Gärtner:
Efficient edge-skeleton computation for polytopes defined by oracles. J. Symb. Comput. 73: 139-152 (2016) - [c6]Samuel Fiorini, Vissarion Fisikopoulos, Marco Macchia:
Two-Level Polytopes with a Prescribed Facet. ISCO 2016: 285-296 - 2015
- [c5]Adam Bohn, Yuri Faenza, Samuel Fiorini, Vissarion Fisikopoulos, Marco Macchia, Kanstantsin Pashkovich:
Enumeration of 2-Level Polytopes. ESA 2015: 191-202 - 2014
- [b1]Vissarion Fisikopoulos:
High-dimensional polytopes defined by oracles: algorithms, computations and applications. National and Kapodistrian University of Athens, Greece, 2014 - [c4]Ioannis Z. Emiris, Vissarion Fisikopoulos:
Efficient Random-Walk Methods for Approximating Polytope Volume. SoCG 2014: 318 - [i6]Ioannis Z. Emiris, Vissarion Fisikopoulos, Bernd Gärtner:
Efficient edge-skeleton computation for polytopes defined by oracles. CoRR abs/1412.3987 (2014) - 2013
- [j1]Ioannis Z. Emiris, Vissarion Fisikopoulos, Christos Konaxis, Luis Mariano Peñaranda:
An Oracle-Based, output-Sensitive Algorithm for Projections of Resultant Polytopes. Int. J. Comput. Geom. Appl. 23(4-5): 397-424 (2013) - [c3]Alicia Dickenstein, Ioannis Z. Emiris, Vissarion Fisikopoulos:
Combinatorics of 4-dimensional resultant polytopes. ISSAC 2013: 173-180 - [i5]Ioannis Z. Emiris, Vissarion Fisikopoulos:
Efficient Random-Walk Methods for Approximating Polytope Volume. CoRR abs/1312.2873 (2013) - 2012
- [c2]Ioannis Z. Emiris, Vissarion Fisikopoulos, Christos Konaxis, Luis Mariano Peñaranda:
An output-sensitive algorithm for computing projections of resultant polytopes. SCG 2012: 179-188 - [c1]Vissarion Fisikopoulos, Luis Mariano Peñaranda:
Faster Geometric Algorithms via Dynamic Determinant Computation. ESA 2012: 443-454 - [i4]Vissarion Fisikopoulos, Luis Mariano Peñaranda:
Faster Geometric Algorithms via Dynamic Determinant Computation. CoRR abs/1206.7067 (2012) - 2011
- [i3]Vissarion Fisikopoulos:
An implementation of range trees with fractional cascading in C++. CoRR abs/1103.4521 (2011) - [i2]Vissarion Fisikopoulos:
Study of the effect of cost policies in the convergence of selfish strategies in Pure Nash Equilibria in Congestion Games. CoRR abs/1103.5071 (2011) - [i1]Ioannis Z. Emiris, Vissarion Fisikopoulos, Christos Konaxis, Luis Mariano Peñaranda:
Efficient Computation of Newton Polytopes of Specialized Resultants. CoRR abs/1108.5985 (2011)
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-08-05 21: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:
