Vitit Kantabutra

23 papers C 1Journal 11Unranked 11
YearRankTypeTitle / Venue / Authors
2022 — conf
Implementing Hypergraph Databases with Fast Relationship Linking and Traversal Using ILE.
CSCI
Vitit Kantabutra
2018 — conf
Comparative Analysis of Various Design Implementations of CLA Carry Chains.
EIT
Naga Spandana Muppaneni, Steve C. Chiu, Vitit Kantabutra, Farshad Dailami
2013 — conf
A Clear Temporal GIS Viewer and Software for Discovering Irregularities in Historical GIS.
DH
Vitit Kantabutra, J. B. Owens
2011 — conf
Better Software Tools for the Humanities and the Social Sciences: A Computer Science Perspective.
DH
Russell Stephenson, Vitit Kantabutra
2011 — conf
Modeling Event-Based Historical Narratives: A Conversation Between Digital Humanists, Information Scientists and Computer Scientists.
DH
Elijah Meeks, Ruth Mostern, Karl E. Grossner, Ryan Shaw, Ramesh C. Jain, Vitit Kantabutra
2010 — conf
On the Benefits of using Linked Data Structures and Dynamically-Allocated Memory for the Modeling and Visualization of Practical Complex Systems.
MSV
Vitit Kantabutra, Charles Burns
2009 — conf
An Infinite Class of Non-Hamiltonian Voronoi Duals Based on Regular Polygons.
FCS
Vitit Kantabutra
2007 — conf
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
Vitit Kantabutra
2006 — conf
Towards Reliable Convergence in the Training of Neural Networks - The Streamlined Glide Algorithm and the LM Glide Algorithm.
MLMTA
Vitit Kantabutra
2004 — conf
Area- and Power-Reduced Standard-Cell Spanning Tree Adders.
ESA/VLSI
Pasquale Corsonello, Stefania Perri, Vitit Kantabutra
1999 — conf
High-radix CORDIC for vector rotation with pipelined FPGA implementation.
ICECS
Vitit Kantabutra
1997 J jnl
Reaching a Point with an Unanchored Robot Arm in a Square.
Int. J. Comput. Geom. Appl.
Vitit Kantabutra
1996 J jnl
On Hardware for Computing Exponential and Trigonometric Functions.
IEEE Trans. Computers
Vitit Kantabutra
1994 J jnl
A Linear-Time Near-Optimum-Length Triangulation Algorithm for Convex Polygons.
J. Comput. Syst. Sci.
Vitit Kantabutra
1994 J jnl
A State Assignment Approach to Asynchronous CMOS Circuit Design.
IEEE Trans. Computers
Vitit Kantabutra, Andreas G. Andreou
1993 J jnl
A Recursive Carry-Lookahead/Carry-Select Hybrid Adder.
IEEE Trans. Computers
Vitit Kantabutra
1993 J jnl
Accelerated Two-Level Carry-Skip Adders-A Type of Very Fast Adders.
IEEE Trans. Computers
Vitit Kantabutra
1993 J jnl
Designing Optimum One-Level Carry-Skip Adders.
IEEE Trans. Computers
Vitit Kantabutra
1992 J jnl
Motions of a Short-Linked Robot Arm in a Square.
Discret. Comput. Geom.
Vitit Kantabutra
1991 C conf
Designing optimum carry-skip adders.
IEEE Symposium on Computer Arithmetic
Vitit Kantabutra
1988 J jnl
A lower bound on the path length of binary trees.
SIGACT News
Vitit Kantabutra
1986 J jnl
New Algorithms for Multilink Robot Arms.
J. Comput. Syst. Sci.
Vitit Kantabutra, S. Rao Kosaraju
1983 J jnl
Traveling Salesman Cycles are not Always Subgraphs of Voronoi Duals.
Inf. Process. Lett.
Vitit Kantabutra