Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVorapong Suppakitpaisarn
Person information
- affiliation: National Institute of Informatics (NII), Tokyo
- affiliation: University of Tokyo, Department of Mathematical Informatics
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j17]Takuto Mitsunobu, Reiji Suda, Vorapong Suppakitpaisarn
:
Worst-case analysis of LPT scheduling on a small number of non-identical processors. Inf. Process. Lett. 183: 106424 (2024)- [j16]Phongtharin Vinayavekhin, Banphatree Khomkham, Vorapong Suppakitpaisarn, Philippe Codognet, Torahiko Terada, Atsushi Miura:
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 17(1): 6:1-6:18 (2024) - 2023
- [j15]Kittiphon Phalakarn, Vorapong Suppakitpaisarn, Francisco Rodríguez-Henríquez, M. Anwar Hasan:
Vectorized and Parallel Computation of Large Smooth-Degree Isogenies using Precedence-Constrained Scheduling. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2023(3): 246-269 (2023) - 2022
- [j14]Vorapong Suppakitpaisarn:
Tight lower bound for average number of terms in optimal double-base number system using information-theoretic tools. Inf. Process. Lett. 175: 106226 (2022) - 2021
- [j13]Vorapong Suppakitpaisarn, Atthaphon Ariyarit, Supanut Chaidee:
A Voronoi-based method for land-use optimization using semidefinite programming and gradient descent algorithm. Int. J. Geogr. Inf. Sci. 35(5): 999-1031 (2021) - [j12]Cam Ly Nguyen, Vorapong Suppakitpaisarn, Athasit Surarerks, Phanu Vajanopath:
On the maximum edge-pair embedding bipartite matching. Theor. Comput. Sci. 882: 109-124 (2021) - 2019
- [j11]Tossaphol Settawatcharawanit, Yi-Han Chiang, Vorapong Suppakitpaisarn, Yusheng Ji:
A Computation-Efficient Approach for Segment Routing Traffic Engineering. IEEE Access 7: 160408-160417 (2019) - [j10]Saran Tarnoi, Wuttipong Kumwilaisak, Vorapong Suppakitpaisarn, Kensuke Fukuda, Yusheng Ji:
Adaptive probabilistic caching technique for caching networks with dynamic content popularity. Comput. Commun. 139: 1-15 (2019) - 2018
- [j9]Jean-François Baffier, Pierre-Louis Poirion, Vorapong Suppakitpaisarn:
Bilevel Model for Adaptive Network Flow Problem. Electron. Notes Discret. Math. 64: 105-114 (2018) - [j8]Kittiphon Phalakarn, Kittiphop Phalakarn, Vorapong Suppakitpaisarn:
Optimal Representation for Right-to-Left Parallel Scalar and Multi-Scalar Point Multiplication. Int. J. Netw. Comput. 8(2): 166-185 (2018) - [j7]Norie Fu, Naonori Kakimura, Kei Kimura, Vorapong Suppakitpaisarn:
Maximum lifetime coverage problem with battery recovery effect. Sustain. Comput. Informatics Syst. 18: 1-13 (2018) - [j6]Alonso Gragera, Vorapong Suppakitpaisarn:
Relaxed triangle inequality ratio of the Sørensen-Dice and Tversky indexes. Theor. Comput. Sci. 718: 37-45 (2018) - 2017
- [j5]Ake Osothongs, Vorapong Suppakitpaisarn, Noboru Sonehara:
Privacy Disclosure Adaptation for Trading between Personal Attributes and Incentives. J. Inf. Process. 25: 2-11 (2017) - 2016
- [j4]Jean-François Baffier, Vorapong Suppakitpaisarn, Hidefumi Hiraishi, Hiroshi Imai:
Parametric multiroute flow and its application to multilink-attack network. Discret. Optim. 22: 20-36 (2016) - [j3]Vorapong Suppakitpaisarn:
An Approximation Algorithm for Multiroute Flow Decomposition. Electron. Notes Discret. Math. 52: 367-374 (2016) - 2015
- [j2]Hiroshi Imai, Vorapong Suppakitpaisarn:
Improving Width-3 Joint Sparse Form to Attain Asymptotically Optimal Complexity on Average Case. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 98-A(6): 1216-1222 (2015) - [j1]Parinya Chalermsook, Hiroshi Imai, Vorapong Suppakitpaisarn:
Two Lower Bounds for Shortest Double-Base Number System. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 98-A(6): 1310-1312 (2015)
Conference and Workshop Papers
- 2023
- [c38]Pengchang Ren, Reiji Suda, Vorapong Suppakitpaisarn:
Efficient Additions and Montgomery Reductions of Large Integers for SIMD. ARITH 2023: 48-59 - [c37]Peerawit Suriya, Vorapong Suppakitpaisarn, Supanut Chaidee, Phapaengmueng Sukkasem:
Submodularity Property for Facility Locations of Dynamic Flow Networks. ATMOS 2023: 10:1-10:13 - [c36]Quentin Hillebrand, Vorapong Suppakitpaisarn, Tetsuo Shibuya:
Unbiased Locally Private Estimator for Polynomials of Laplacian Variables. KDD 2023: 741-751 - 2022
- [c35]Kittiphon Phalakarn, Vorapong Suppakitpaisarn, M. Anwar Hasan:
Speeding-Up Parallel Computation of Large Smooth-Degree Isogeny Using Precedence-Constrained Scheduling. ACISP 2022: 309-331 - [c34]Jing Bi, Vorapong Suppakitpaisarn:
Performances of Symmetric Loss for Private Data from Exponential Mechanism. CANDARW 2022: 154-160 - [c33]Pengchang Ren, Reiji Suda, Vorapong Suppakitpaisarn:
Throughput-Optimized Implementation of Isogeny-based Cryptography on Vectorized ARM SVE Processor. CANDAR 2022: 165-171 - [c32]Phongtharin Vinayavekhin, Vorapong Suppakitpaisarn, Philippe Codognet, Torahiko Terada, Atsushi Miura:
Learning Similarity for Discovering Inspirations of Western Arts in Japanese Culture. ICPR Workshops (3) 2022: 78-92 - [c31]Bodhayan Roy, Vorapong Suppakitpaisarn, Bubai Manna, Cam Ly Nguyen:
Minimum Target Coverage for Air Quality Monitoring Using Bus Routes. VTC Fall 2022: 1-7 - 2021
- [c30]Kittiphon Phalakarn, Vorapong Suppakitpaisarn, M. Anwar Hasan:
Single-round Lattice-based Multisignatures. CANDAR (Workshops) 2021: 365-371 - [c29]Kittiphop Phalakarn, Vorapong Suppakitpaisarn, Nuttapong Attrapadung, Kanta Matsuura:
Evolving Homomorphic Secret Sharing for Hierarchical Access Structures. IWSEC 2021: 77-96 - 2020
- [c28]Maneesh Babu Adhikari, Vorapong Suppakitpaisarn, Arinjita Paul, C. Pandu Rangan:
Two-Stage Framework for Accurate and Differentially Private Network Information Publication. CSoNet 2020: 267-279 - [c27]Kittiphop Phalakarn, Vorapong Suppakitpaisarn, Nuttapong Attrapadung, Kanta Matsuura:
Constructive t-secure Homomorphic Secret Sharing for Low Degree Polynomials. INDOCRYPT 2020: 763-785 - [c26]Arinjita Paul, Vorapong Suppakitpaisarn, Mitali Bafna, C. Pandu Rangan:
Improving Accuracy of Differentially Private Kronecker Social Networks via Graph Clustering. ISNCC 2020: 1-6 - [c25]Zijian Xu, Dejun Mao, Vorapong Suppakitpaisarn:
PACE Solver Description: Computing Exact Treedepth via Minimal Separators. IPEC 2020: 31:1-31:4 - [c24]Cam Ly Nguyen, Vorapong Suppakitpaisarn, Athasit Surarerks, Phanu Vajanopath:
On the Maximum Edge-Pair Embedding Bipartite Matching. WALCOM 2020: 236-248 - 2019
- [c23]Arinjita Paul, Vorapong Suppakitpaisarn, C. Pandu Rangan:
Smart Contract-Driven Mechanism Design to Mitigate Information Diffusion in Social Networks. MARBLE 2019: 201-216 - 2018
- [c22]Cam Ly Nguyen, Orestis Georgiou, Vorapong Suppakitpaisarn:
Improved Localization Accuracy Using Machine Learning: Predicting and Refining RSS Measurements. GLOBECOM Workshops 2018: 1-7 - [c21]Xusheng Zhang, Vorapong Suppakitpaisarn:
An Approximation Algorithm for Incrementally Deploying SDN Forwarding Devices. IMCOM 2018: 38:1-38:8 - [c20]Tossaphol Settawatcharawanit, Vorapong Suppakitpaisarn, Shigeki Yamada, Yusheng Ji:
Segment Routed Traffic Engineering with Bounded Stretch in Software-Defined Networks. LCN 2018: 477-480 - 2017
- [c19]Prompong Pakawanwong, Vorapong Suppakitpaisarn, Liwen Xu, Naonori Kakimura:
Reducing Recovery Error in Compressive Sensing with Limited Number of Base Stations. GLOBECOM 2017: 1-7 - [c18]Kittiphon Phalakarn, Kittiphop Phalakarn, Vorapong Suppakitpaisarn:
Optimal Representation for Right-to-Left Parallel Scalar Point Multiplication. CANDAR 2017: 482-488 - 2016
- [c17]Kittiphop Phalakarn, Kittiphon Phalakarn, Vorapong Suppakitpaisarn:
Parallelized Side-Channel Attack Resisted Scalar Multiplication Using q-Based Addition-Subtraction k-Chains. CANDAR 2016: 140-146 - [c16]Alonso Gragera, Vorapong Suppakitpaisarn:
A Mapping Heuristic for Minimizing Message Latency in Massively Distributed MCTS. CANDAR 2016: 547-553 - [c15]Rohit Kumar Singh, Vorapong Suppakitpaisarn, Ake Osothongs:
Improving Motivation in Survey Participation by Question Reordering. PKAW 2016: 231-240 - [c14]Alonso Gragera, Vorapong Suppakitpaisarn:
Semimetric Properties of Sørensen-Dice and Tversky Indexes. WALCOM 2016: 339-350 - 2015
- [c13]Ake Osothongs, Vorapong Suppakitpaisan, Noboru Sonehara:
A Prototype Decision Support System for Privacy-Service Trading. BigMM 2015: 282-283 - [c12]Norie Fu, Vorapong Suppakitpaisarn:
Clustering 1-Dimensional Periodic Network Using Betweenness Centrality. CSoNet 2015: 128-139 - [c11]Vorapong Suppakitpaisarn, Wenkai Dai, Jean-François Baffier:
Robust network flow against attackers with knowledge of routing method. HPSR 2015: 40-47 - [c10]Ake Osothongs, Vorapong Suppakitpaisan, Noboru Sonehara:
Evaluating the importance of personal information attributes using graph mining technique. IMCOM 2015: 104:1-104:8 - [c9]Saran Tarnoi, Vorapong Suppakitpaisarn, Wuttipong Kumwilaisak, Yusheng Ji:
Performance analysis of probabilistic caching scheme using Markov chains. LCN 2015: 46-54 - [c8]Jean-François Baffier, Vorapong Suppakitpaisarn:
Algorithms for finding robust and sustainable network flows against multilink-attack. RNDM@WMNC 2015: 251-258 - 2014
- [c7]Norie Fu, Vorapong Suppakitpaisarn, Kei Kimura, Naonori Kakimura:
Maximum lifetime coverage problems with battery recovery effects. GLOBECOM 2014: 118-124 - [c6]Jean-François Baffier, Vorapong Suppakitpaisarn, Hidefumi Hiraishi, Hiroshi Imai:
Parametric Multiroute Flow and Its Application to Robust Network with k Edge Failures. ISCO 2014: 26-37 - [c5]Vorapong Suppakitpaisarn, Hiroshi Imai:
Worst case computation time for minimal joint Hamming weight numeral system. ISITA 2014: 138-142 - [c4]Jean-François Baffier, Vorapong Suppakitpaisarn:
A (k + 1)-Approximation Robust Network Flow Algorithm and a Tighter Heuristic Method Using Iterative Multiroute Flow. WALCOM 2014: 68-79 - 2012
- [c3]Vorapong Suppakitpaisarn, Masato Edahiro, Hiroshi Imai:
Fast Elliptic Curve Cryptography Using Minimal Weight Conversion of d Integers. AISC 2012: 15-26 - [c2]Vorapong Suppakitpaisarn, Masato Edahiro, Hiroshi Imai:
Calculating Average Joint Hamming Weight for Minimal Weight Conversion of d Integers. WALCOM 2012: 229-240 - [c1]Vorapong Suppakitpaisarn, Hiroshi Imai, Masato Edahiro:
Fastest multi-scalar multiplication based on optimal double-base chains. WorldCIS 2012: 93-98
Reference Works
- 2019
- [r1]Alonso Gragera Aguaza, Jean-François Baffier, Vorapong Suppakitpaisarn:
Skull and Roses Card Game. Encyclopedia of Computer Graphics and Games 2019
Informal and Other Publications
- 2024
- [i16]Vorapong Suppakitpaisarn, Jin-Kao Hao:
Utilizing Graph Sparsification for Pre-processing in Maxcut QUBO Solver. CoRR abs/2401.13004 (2024) - 2023
- [i15]Pengchang Ren, Reiji Suda, Vorapong Suppakitpaisarn:
Efficient Additions and Montgomery Reductions of Large Integers for SIMD. CoRR abs/2308.16432 (2023) - [i14]Sayan Mukherjee, Vorapong Suppakitpaisarn:
Robustness for Spectral Clustering of General Graphs under Local Differential Privacy. CoRR abs/2309.06867 (2023) - [i13]Louis Betzer, Vorapong Suppakitpaisarn, Quentin Hillebrand:
Local Differential Privacy for Number of Paths and Katz Centrality. CoRR abs/2310.14000 (2023) - [i12]Quentin Hillebrand, Vorapong Suppakitpaisarn, Tetsuo Shibuya:
Communication Cost Reduction for Subgraph Counting under Local Differential Privacy via Hash Functions. CoRR abs/2312.07055 (2023) - [i11]Kittiphon Phalakarn, Vorapong Suppakitpaisarn, Francisco Rodríguez-Henríquez, M. Anwar Hasan:
Vectorized and Parallel Computation of Large Smooth-Degree Isogenies using Precedence-Constrained Scheduling. IACR Cryptol. ePrint Arch. 2023: 885 (2023) - [i10]Kittiphop Phalakarn, Vorapong Suppakitpaisarn, Nuttapong Attrapadung, Kanta Matsuura:
Constructive t-secure Homomorphic Secret Sharing for Low Degree Polynomials. IACR Cryptol. ePrint Arch. 2023: 1167 (2023) - [i9]Kittiphop Phalakarn, Vorapong Suppakitpaisarn, Nuttapong Attrapadung, Kanta Matsuura:
Evolving Homomorphic Secret Sharing for Hierarchical Access Structures. IACR Cryptol. ePrint Arch. 2023: 1168 (2023) - 2022
- [i8]Takuto Mitsunobu, Reiji Suda, Vorapong Suppakitpaisarn:
Worst-Case Analysis of LPT Scheduling on Small Number of Non-Identical Processors. CoRR abs/2203.02724 (2022) - [i7]Jing Bi, Vorapong Suppakitpaisarn:
Performances of Symmetric Loss for Private Data from Exponential Mechanism. CoRR abs/2210.04132 (2022) - [i6]Kittiphon Phalakarn, Vorapong Suppakitpaisarn, M. Anwar Hasan:
Speeding-Up Parallel Computation of Large Smooth-Degree Isogeny using Precedence-Constrained Scheduling. IACR Cryptol. ePrint Arch. 2022: 1103 (2022) - 2021
- [i5]Vorapong Suppakitpaisarn:
Tight Lower Bound for Average Number of Terms in Optimal Double-base Number System. CoRR abs/2104.06222 (2021) - 2020
- [i4]Zijian Xu, Vorapong Suppakitpaisarn:
On the Size of Minimal Separators for Treedepth Decomposition. CoRR abs/2008.09822 (2020) - 2016
- [i3]Kittiphop Phalakarn, Kittiphon Phalakarn, Vorapong Suppakitpaisarn:
Parallelized Side-Channel Attack Resisted Scalar Multiplication Using q-Based Addition-Subtraction k-chains. IACR Cryptol. ePrint Arch. 2016: 899 (2016) - 2011
- [i2]Vorapong Suppakitpaisarn, Masato Edahiro, Hiroshi Imai:
Fast Elliptic Curve Cryptography Using Optimal Double-Base Chains. IACR Cryptol. ePrint Arch. 2011: 30 (2011) - 2010
- [i1]Vorapong Suppakitpaisarn, Masato Edahiro, Hiroshi Imai:
Optimal Average Joint Hamming Weight and Minimal Weight Conversion of d Integers. IACR Cryptol. ePrint Arch. 2010: 300 (2010)
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 01:53 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:
