Vorapong Suppakitpaisarn

Orcid: 0000-0002-7020-395X

Affiliations:
  • National Institute of Informatics (NII), Tokyo
  • University of Tokyo, Department of Mathematical Informatics


According to our database1, Vorapong Suppakitpaisarn authored at least 67 papers between 2010 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Identifying Relationships and Classifying Western-style Paintings: Machine Learning Approaches for Artworks by Western Artists and Meiji-era Japanese Artists.
ACM Journal on Computing and Cultural Heritage, February, 2024

Worst-case analysis of LPT scheduling on a small number of non-identical processors.
Inf. Process. Lett., January, 2024

On the size of minimal separators for treedepth decomposition.
Discret. Appl. Math., 2024

Cycle Counting under Local Differential Privacy for Degeneracy-bounded Graphs.
CoRR, 2024

On Approximating the Dynamic and Discrete Network Flow Problem.
CoRR, 2024

Utilizing Graph Sparsification for Pre-processing in Maxcut QUBO Solver.
CoRR, 2024

Utilizing Graph Sparsification for Pre-processing in Max Cut QUBO Solver.
Proceedings of the Metaheuristics - 15th International Conference, 2024

Minsum Problem for Discrete and Weighted Set Flow on Dynamic Path Network.
Proceedings of the Algorithmic Aspects in Information and Management, 2024

2023
Vectorized and Parallel Computation of Large Smooth-Degree Isogenies using Precedence-Constrained Scheduling.
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2023

Evolving Homomorphic Secret Sharing for Hierarchical Access Structures.
IACR Cryptol. ePrint Arch., 2023

Constructive t-secure Homomorphic Secret Sharing for Low Degree Polynomials.
IACR Cryptol. ePrint Arch., 2023

Communication Cost Reduction for Subgraph Counting under Local Differential Privacy via Hash Functions.
CoRR, 2023

Local Differential Privacy for Number of Paths and Katz Centrality.
CoRR, 2023

Robustness for Spectral Clustering of General Graphs under Local Differential Privacy.
CoRR, 2023

Unbiased Locally Private Estimator for Polynomials of Laplacian Variables.
Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2023

Submodularity Property for Facility Locations of Dynamic Flow Networks.
Proceedings of the 23rd Symposium on Algorithmic Approaches for Transportation Modelling, 2023

Efficient Additions and Montgomery Reductions of Large Integers for SIMD.
Proceedings of the 30th IEEE Symposium on Computer Arithmetic, 2023

2022
Tight lower bound for average number of terms in optimal double-base number system using information-theoretic tools.
Inf. Process. Lett., 2022

Speeding-Up Parallel Computation of Large Smooth-Degree Isogeny using Precedence-Constrained Scheduling.
IACR Cryptol. ePrint Arch., 2022

Minimum Target Coverage for Air Quality Monitoring Using Bus Routes.
Proceedings of the 96th Vehicular Technology Conference, 2022

Learning Similarity for Discovering Inspirations of Western Arts in Japanese Culture.
Proceedings of the Pattern Recognition, Computer Vision, and Image Processing. ICPR 2022 International Workshops and Challenges, 2022

Throughput-Optimized Implementation of Isogeny-based Cryptography on Vectorized ARM SVE Processor.
Proceedings of the Tenth International Symposium on Computing and Networking, 2022

Performances of Symmetric Loss for Private Data from Exponential Mechanism.
Proceedings of the 2022 Tenth International Symposium on Computing and Networking, CANDAR 2022, 2022

2021
On the maximum edge-pair embedding bipartite matching.
Theor. Comput. Sci., 2021

A Voronoi-based method for land-use optimization using semidefinite programming and gradient descent algorithm.
Int. J. Geogr. Inf. Sci., 2021

Tight Lower Bound for Average Number of Terms in Optimal Double-base Number System.
CoRR, 2021

Single-round Lattice-based Multisignatures.
Proceedings of the Ninth International Symposium on Computing and Networking, 2021

2020
PACE Solver Description: Computing Exact Treedepth via Minimal Separators.
Proceedings of the 15th International Symposium on Parameterized and Exact Computation, 2020

Improving Accuracy of Differentially Private Kronecker Social Networks via Graph Clustering.
Proceedings of the 2020 International Symposium on Networks, Computers and Communications, 2020

Two-Stage Framework for Accurate and Differentially Private Network Information Publication.
Proceedings of the Computational Data and Social Networks - 9th International Conference, 2020

2019
Skull and Roses Card Game.
Proceedings of the Encyclopedia of Computer Graphics and Games., 2019

Adaptive probabilistic caching technique for caching networks with dynamic content popularity.
Comput. Commun., 2019

A Computation-Efficient Approach for Segment Routing Traffic Engineering.
IEEE Access, 2019

Smart Contract-Driven Mechanism Design to Mitigate Information Diffusion in Social Networks.
Proceedings of the 1st International Conference on Mathematical Research for Blockchain Economy, 2019

2018
Relaxed triangle inequality ratio of the Sørensen-Dice and Tversky indexes.
Theor. Comput. Sci., 2018

Maximum lifetime coverage problem with battery recovery effect.
Sustain. Comput. Informatics Syst., 2018

Optimal Representation for Right-to-Left Parallel Scalar and Multi-Scalar Point Multiplication.
Int. J. Netw. Comput., 2018

Bilevel Model for Adaptive Network Flow Problem.
Electron. Notes Discret. Math., 2018

Segment Routed Traffic Engineering with Bounded Stretch in Software-Defined Networks.
Proceedings of the 43rd IEEE Conference on Local Computer Networks, 2018

An Approximation Algorithm for Incrementally Deploying SDN Forwarding Devices.
Proceedings of the 12th International Conference on Ubiquitous Information Management and Communication, 2018

Improved Localization Accuracy Using Machine Learning: Predicting and Refining RSS Measurements.
Proceedings of the IEEE Globecom Workshops, 2018

2017
Privacy Disclosure Adaptation for Trading between Personal Attributes and Incentives.
J. Inf. Process., 2017

Optimal Representation for Right-to-Left Parallel Scalar Point Multiplication.
Proceedings of the Fifth International Symposium on Computing and Networking, 2017

Reducing Recovery Error in Compressive Sensing with Limited Number of Base Stations.
Proceedings of the 2017 IEEE Global Communications Conference, 2017

2016
Parallelized Side-Channel Attack Resisted Scalar Multiplication Using q-Based Addition-Subtraction k-chains.
IACR Cryptol. ePrint Arch., 2016

An Approximation Algorithm for Multiroute Flow Decomposition.
Electron. Notes Discret. Math., 2016

Parametric multiroute flow and its application to multilink-attack network.
Discret. Optim., 2016

Semimetric Properties of Sørensen-Dice and Tversky Indexes.
Proceedings of the WALCOM: Algorithms and Computation - 10th International Workshop, 2016

Improving Motivation in Survey Participation by Question Reordering.
Proceedings of the Knowledge Management and Acquisition for Intelligent Systems, 2016

A Mapping Heuristic for Minimizing Message Latency in Massively Distributed MCTS.
Proceedings of the Fourth International Symposium on Computing and Networking, 2016

2015
Improving Width-3 Joint Sparse Form to Attain Asymptotically Optimal Complexity on Average Case.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015

Two Lower Bounds for Shortest Double-Base Number System.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015

Algorithms for finding robust and sustainable network flows against multilink-attack.
Proceedings of the 7th International Workshop on Reliable Networks Design and Modeling, 2015

Performance analysis of probabilistic caching scheme using Markov chains.
Proceedings of the 40th IEEE Conference on Local Computer Networks, 2015

Evaluating the importance of personal information attributes using graph mining technique.
Proceedings of the 9th International Conference on Ubiquitous Information Management and Communication, 2015

Robust network flow against attackers with knowledge of routing method.
Proceedings of the 16th IEEE International Conference on High Performance Switching and Routing, 2015

Clustering 1-Dimensional Periodic Network Using Betweenness Centrality.
Proceedings of the Computational Social Networks - 4th International Conference, 2015

A Prototype Decision Support System for Privacy-Service Trading.
Proceedings of the 2015 IEEE International Conference on Multimedia Big Data, BigMM 2015, 2015

2014
A (k + 1)-Approximation Robust Network Flow Algorithm and a Tighter Heuristic Method Using Iterative Multiroute Flow.
Proceedings of the Algorithms and Computation - 8th International Workshop, 2014

Worst case computation time for minimal joint Hamming weight numeral system.
Proceedings of the International Symposium on Information Theory and its Applications, 2014

Parametric Multiroute Flow and Its Application to Robust Network with k Edge Failures.
Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

Maximum lifetime coverage problems with battery recovery effects.
Proceedings of the IEEE Global Communications Conference, 2014

2012
Fastest multi-scalar multiplication based on optimal double-base chains.
Proceedings of the 2012 World Congress on Internet Security, 2012

Calculating Average Joint Hamming Weight for Minimal Weight Conversion of d Integers.
Proceedings of the WALCOM: Algorithms and Computation - 6th International Workshop, 2012

Fast Elliptic Curve Cryptography Using Minimal Weight Conversion of d Integers.
Proceedings of the Tenth Australasian Information Security Conference, 2012

2011
Fast Elliptic Curve Cryptography Using Optimal Double-Base Chains.
IACR Cryptol. ePrint Arch., 2011

2010
Optimal Average Joint Hamming Weight and Minimal Weight Conversion of d Integers.
IACR Cryptol. ePrint Arch., 2010


  Loading...