Scholar
Suthee Ruangwises
Google Scholar ID: EQMimNwAAAAJ
Chulalongkorn University
card-based cryptography
puzzles
computational complexity
matching under preferences
Follow
Homepage
↗
Google Scholar
↗
Citations & Impact
All-time
Citations
461
H-index
12
i10-index
12
Publications
20
Co-authors
9
list available
Contact
CV
Open ↗
Publications
8 items
A Complexity Hierarchy of Shuffles in Card-Based Protocols
2026
Cited
0
Wataridori is NP-Complete
2026
Cited
0
NP-Completeness Proofs of All or Nothing and Water Walk Using the T-Metacell Framework
2025
Cited
0
ASP-Completeness Proofs of Puzzles Using the T-Metacell Framework
2025
Cited
0
Simulating Virtual Players for UNO without Computers
2025
Cited
0
Balance-Based Cryptography: Physically Computing Any Boolean Function
2025
Cited
0
NP-Completeness and Physical Zero-Knowledge Proofs for Zeiger
arXiv.org · 2024
Cited
0
Tatami Printer: Physical ZKPs for Tatami Puzzles
arXiv.org · 2024
Cited
0
Resume (English only)
Co-authors
9 total
Co-author 1
Co-author 2
Co-author 3
Co-author 4
Co-author 5
Co-author 6
Co-author 7
Co-author 8
×
Welcome back
Sign in to Agora
Welcome back! Please sign in to continue.
Email address
Password
Forgot password?
Continue
Do not have an account?
Sign up