default search action
Athasit Surarerks
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [i1]Kittiphop Phalakarn, Athasit Surarerks:
Faster cellular automata cryptosystems with neighbor sequences. IACR Cryptol. ePrint Arch. 2023: 1186 (2023) - 2021
- [j3]Cam Ly Nguyen, Vorapong Suppakitpaisarn, Athasit Surarerks, Phanu Vajanopath:
On the maximum edge-pair embedding bipartite matching. Theor. Comput. Sci. 882: 109-124 (2021) - 2020
- [c19]Cam Ly Nguyen, Vorapong Suppakitpaisarn, Athasit Surarerks, Phanu Vajanopath:
On the Maximum Edge-Pair Embedding Bipartite Matching. WALCOM 2020: 236-248
2010 – 2019
- 2018
- [c18]Tevich Treethanyaphong, Athasit Surarerks:
Dynamic Symmetry Breaking in SAT using Augmented Clauses with a Polynomial-Time Lexicographic Pruning. EECS 2018: 242-247 - [c17]Teerapat Chundetsumrit, Athasit Surarerks:
Approximation of Positive Integer in Double-Base Number System with a Single Term. EECS 2018: 569-576 - 2016
- [c16]Pipop Thienprapasith
, Athasit Surarerks:
Flexible interval representation system in negative binary base. KST 2016: 190-195 - 2014
- [c15]Chaisup Wongsaroj, Nakornthip Prompoon, Athasit Surarerks:
A music similarity measure based on chord progression and song segmentation analysis. DICTAP 2014: 158-163 - [c14]Sorapol Chompaisal, Komate Amphawan, Athasit Surarerks:
Mining N-most Interesting Multi-level Frequent Itemsets without Support Threshold. IC2IT 2014: 125-134 - 2013
- [c13]Arnon Rungsawang, Sompop Siangkhio, Athasit Surarerks, Bundit Manaskasemsak:
Thai Wikipedia Link Suggestion Framework. ITCS 2013: 365-373 - [c12]Bundit Manaskasemsak, Pramote Teerasetmanakul, Kankamol Tongtip, Athasit Surarerks, Arnon Rungsawang:
Computing Personalized PageRank Based on Temporal-Biased Proximity. ITCS 2013: 375-385 - 2012
- [j2]Komate Amphawan, Philippe Lenca, Athasit Surarerks:
Mining top-k regular-frequent itemsets using database partitioning and support estimation. Expert Syst. Appl. 39(2): 1924-1936 (2012) - [j1]Komate Amphawan, Philippe Lenca, Athasit Surarerks:
Erratum to "Mining top-k regular-frequent itemsets using database partitioning and support estimation" [Expert Systems with Applications 39 (2) (2011) 1924-1936]. Expert Syst. Appl. 39(6): 6275 (2012) - [c11]Warit Leopairote, Athasit Surarerks, Nakornthip Prompoon:
Software quality in use characteristic mining from customer reviews. DICTAP 2012: 434-439 - 2011
- [c10]Warawoot Pacharoen, Toshiaki Aoki
Conformance Verification between Web Service Choreography and Implementation Using Learning and Model Checking. ICWS 2011: 722-723 - [c9]Komate Amphawan, Philippe Lenca, Athasit Surarerks:
Efficient Mining Top-k Regular-Frequent Itemset Using Compressed Tidsets. PAKDD Workshops 2011: 124-135 - 2010
- [c8]Komate Amphawan, Athasit Surarerks, Philippe Lenca:
Mining Periodic-Frequent Itemsets with Approximate Periodicity Using Interval Transaction-Ids List Tree. WKDD 2010: 245-248
2000 – 2009
- 2009
- [c7]Komate Amphawan, Philippe Lenca, Athasit Surarerks:
Mining Top-K Periodic-Frequent Pattern from Transactional Databases without Support Threshold. IAIT 2009: 18-29 - 2008
- [c6]Kiattikun Chobtham, Athasit Surarerks, Arnon Rungsawang:
Formalization of Link Farm Structure Using Graph Grammar. AINA 2008: 904-911 - 2007
- [c5]Bundit Manaskasemsak, Nunnapus Benjamas, Arnon Rungsawang, Athasit Surarerks, Putchong Uthayopas:
Parallel association rule mining based on FI-growth algorithm. ICPADS 2007: 1-8 - 2006
- [c4]Chakkanart Vivatanavorasin, Nakornthip Prompoon, Athasit Surarerks:
A Process Model Design and Tool Development for Supplier Agreement Management of CMMI: Capability Level 2. APSEC 2006: 385-392 - [c3]Natthapon Punthong, Athasit Surarerks:
Online Prefix-Free Encoding Algorithm. SPPRA 2006: 165-170 - 2004
- [c2]S. Jansamak, Athasit Surarerks:
Formalization of UML Statechart Models Using Concurrent Regular Expressions. ACSC 2004: 83-88 - 2003
- [c1]Christiane Frougny, Athasit Surarerks:
On-Line Multiplication in Real and Complex Base. IEEE Symposium on Computer Arithmetic 2003: 212-219
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 05:41 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: