default search action
Vitit Kantabutra
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [c12]Vitit Kantabutra:
Implementing Hypergraph Databases with Fast Relationship Linking and Traversal Using ILE. CSCI 2022: 742-747
2010 – 2019
- 2018
- [c11]Naga Spandana Muppaneni, Steve C. Chiu, Vitit Kantabutra, Farshad Dailami:
Comparative Analysis of Various Design Implementations of CLA Carry Chains. EIT 2018: 713-718 - 2013
- [c10]Vitit Kantabutra, J. B. Owens:
A Clear Temporal GIS Viewer and Software for Discovering Irregularities in Historical GIS. DH 2013: 251-252 - 2011
- [c9]Elijah Meeks, Ruth Mostern, Karl E. Grossner, Ryan Shaw, Ramesh C. Jain, Vitit Kantabutra:
Modeling Event-Based Historical Narratives: A Conversation Between Digital Humanists, Information Scientists and Computer Scientists. DH 2011: 45-46 - [c8]Russell Stephenson, Vitit Kantabutra:
Better Software Tools for the Humanities and the Social Sciences: A Computer Science Perspective. DH 2011: 370 - 2010
- [c7]Vitit Kantabutra, Charles Burns:
On the Benefits of using Linked Data Structures and Dynamically-Allocated Memory for the Modeling and Visualization of Practical Complex Systems. MSV 2010: 23-28
2000 – 2009
- 2009
- [c6]Vitit Kantabutra:
An Infinite Class of Non-Hamiltonian Voronoi Duals Based on Regular Polygons. FCS 2009: 92-94 - 2007
- [c5]Vitit Kantabutra:
A New Type of Database Systems: Intentionally-Linked Entities - a Detailed Suggestion for a Direct Way to Implement the Entity-Relationship Data Model. CSREA EEE 2007: 258-263 - 2006
- [c4]Vitit Kantabutra:
Towards Reliable Convergence in the Training of Neural Networks - The Streamlined Glide Algorithm and the LM Glide Algorithm. MLMTA 2006: 80-87 - 2004
- [c3]Pasquale Corsonello, Stefania Perri, Vitit Kantabutra:
Area- and Power-Reduced Standard-Cell Spanning Tree Adders. ESA/VLSI 2004: 343-352
1990 – 1999
- 1999
- [c2]Vitit Kantabutra:
High-radix CORDIC for vector rotation with pipelined FPGA implementation. ICECS 1999: 1131-1134 - 1997
- [j11]Vitit Kantabutra:
Reaching a Point with an Unanchored Robot Arm in a Square. Int. J. Comput. Geom. Appl. 7(6): 539-550 (1997) - 1996
- [j10]Vitit Kantabutra:
On Hardware for Computing Exponential and Trigonometric Functions. IEEE Trans. Computers 45(3): 328-339 (1996) - 1994
- [j9]Vitit Kantabutra:
A Linear-Time Near-Optimum-Length Triangulation Algorithm for Convex Polygons. J. Comput. Syst. Sci. 49(2): 325-333 (1994) - [j8]Vitit Kantabutra, Andreas G. Andreou:
A State Assignment Approach to Asynchronous CMOS Circuit Design. IEEE Trans. Computers 43(4): 460-469 (1994) - 1993
- [j7]Vitit Kantabutra:
Designing Optimum One-Level Carry-Skip Adders. IEEE Trans. Computers 42(6): 759-764 (1993) - [j6]Vitit Kantabutra:
Accelerated Two-Level Carry-Skip Adders-A Type of Very Fast Adders. IEEE Trans. Computers 42(11): 1389-1393 (1993) - [j5]Vitit Kantabutra:
A Recursive Carry-Lookahead/Carry-Select Hybrid Adder. IEEE Trans. Computers 42(12): 1495-1499 (1993) - 1992
- [j4]Vitit Kantabutra:
Motions of a Short-Linked Robot Arm in a Square. Discret. Comput. Geom. 7: 69-76 (1992) - 1991
- [c1]Vitit Kantabutra:
Designing optimum carry-skip adders. IEEE Symposium on Computer Arithmetic 1991: 146-153
1980 – 1989
- 1988
- [j3]Vitit Kantabutra:
A lower bound on the path length of binary trees. SIGACT News 19(2): 48-50 (1988) - 1986
- [j2]Vitit Kantabutra, S. Rao Kosaraju:
New Algorithms for Multilink Robot Arms. J. Comput. Syst. Sci. 32(1): 136-153 (1986) - 1983
- [j1]Vitit Kantabutra:
Traveling Salesman Cycles are not Always Subgraphs of Voronoi Duals. Inf. Process. Lett. 16(1): 11-12 (1983)
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:58 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: