Vissarion Fisikopoulos

Orcid: 0000-0002-0780-666X

Affiliations:
  • Oracle, France


According to our database1, Vissarion Fisikopoulos authored at least 31 papers between 2011 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Randomized Control in Performance Analysis and Empirical Asset Pricing.
CoRR, 2024

2023
A Practical Algorithm for Volume Estimation based on Billiard Trajectories and Simulated Annealing.
ACM J. Exp. Algorithmics, December, 2023

Truncated Log-concave Sampling for Convex Bodies with Reflective Hamiltonian Monte Carlo.
ACM Trans. Math. Softw., June, 2023

Geometric algorithms for sampling the flux space of metabolic networks.
J. Comput. Geom., 2023

Practical volume approximation of high-dimensional convex bodies, applied to modeling portfolio dependencies and financial crises.
Comput. Geom., 2023

Randomized geometric tools for anomaly detection in stock markets.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

2022
Fast Floating-Point Filters for Robust Predicates.
CoRR, 2022

2021
volesti: Volume Approximation and Sampling for Convex Polytopes in R.
R J., 2021

Truncated Log-concave Sampling with Reflective Hamiltonian Monte Carlo.
CoRR, 2021

Geometric Algorithms for Sampling the Flux Space of Metabolic Networks.
Proceedings of the 37th International Symposium on Computational Geometry, 2021

2020
Efficient Sampling from Feasible Sets of SDPs and Volume Approximation.
CoRR, 2020

Sampling the feasible sets of SDPs and volume approximation.
ACM Commun. Comput. Algebra, 2020

Practical Volume Estimation of Zonotopes by a New Annealing Schedule for Cooling Convex Bodies.
Proceedings of the Mathematical Software - ICMS 2020, 2020

2019
Enumeration of 2-level polytopes.
Math. Program. Comput., 2019

Practical Volume Estimation by a New Annealing Schedule for Cooling Convex Bodies.
CoRR, 2019

2018
Practical Polytope Volume Approximation.
ACM Trans. Math. Softw., 2018

Algorithms for Deciding Membership in Polytopes of General Dimension.
CoRR, 2018

Polytope Membership in High Dimension.
Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018

Practical Volume Computation of Structured Convex Bodies, and an Application to Modeling Portfolio Dependencies and Financial Crises.
Proceedings of the 34th International Symposium on Computational Geometry, 2018

2017
Experimental Study of the Ehrhart Interpolation Polytope.
Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2017

2016
Efficient edge-skeleton computation for polytopes defined by oracles.
J. Symb. Comput., 2016

Faster geometric algorithms via dynamic determinant computation.
Comput. Geom., 2016

Two-Level Polytopes with a Prescribed Facet.
Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016

2014
High-dimensional polytopes defined by oracles: algorithms, computations and applications
PhD thesis, 2014

Efficient Random-Walk Methods for Approximating Polytope Volume.
Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

2013
An Oracle-Based, output-Sensitive Algorithm for Projections of Resultant Polytopes.
Int. J. Comput. Geom. Appl., 2013

Combinatorics of 4-dimensional resultant polytopes.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013

2012
An output-sensitive algorithm for computing projections of resultant polytopes.
Proceedings of the 28th ACM Symposium on Computational Geometry, 2012

2011
Efficient Computation of Newton Polytopes of Specialized Resultants
CoRR, 2011

Study of the effect of cost policies in the convergence of selfish strategies in Pure Nash Equilibria in Congestion Games
CoRR, 2011

An implementation of range trees with fractional cascading in C++
CoRR, 2011


  Loading...