 | 2010 |
|---|
| 16 |       | 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 |
| 2009 |
|---|
| 15 | | Vitit Kantabutra:
An Infinite Class of Non-Hamiltonian Voronoi Duals Based on Regular Polygons.
FCS 2009: 92-94 |
| 2007 |
|---|
| 14 | | 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 |
|---|
| 13 | | 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 |
|---|
| 12 | | Pasquale Corsonello,
Stefania Perri,
Vitit Kantabutra:
Area- and Power-Reduced Standard-Cell Spanning Tree Adders.
ESA/VLSI 2004: 343-352 |
| 1997 |
|---|
| 11 | | Vitit Kantabutra:
Reaching a Point with an Unanchored Robot Arm in a Square.
Int. J. Comput. Geometry Appl. 7(6): 539-550 (1997) |
| 1996 |
|---|
| 10 |  | Vitit Kantabutra:
On Hardware for Computing Exponential and Trigonometric Functions.
IEEE Trans. Computers 45(3): 328-339 (1996) |
| 1994 |
|---|
| 9 | | Vitit Kantabutra,
Andreas G. Andreou:
A State Assignment Approach to Asynchronous CMOS Circuit Design.
IEEE Trans. Computers 43(4): 460-469 (1994) |
| 8 | | Vitit Kantabutra:
A Linear-Time Near-Optimum-Length Triangulation Algorithm for Convex Polygons.
J. Comput. Syst. Sci. 49(2): 325-333 (1994) |
| 1993 |
|---|
| 7 | | Vitit Kantabutra:
Accelerated Two-Level Carry-Skip Adders-A Type of Very Fast Adders.
IEEE Trans. Computers 42(11): 1389-1393 (1993) |
| 6 | | Vitit Kantabutra:
A Recursive Carry-Lookahead/Carry-Select Hybrid Adder.
IEEE Trans. Computers 42(12): 1495-1499 (1993) |
| 5 | | Vitit Kantabutra:
Designing Optimum One-Level Carry-Skip Adders.
IEEE Trans. Computers 42(6): 759-764 (1993) |
| 1992 |
|---|
| 4 | | Vitit Kantabutra:
Motions of a Short-Linked Robot Arm in a Square.
Discrete & Computational Geometry 7: 69-76 (1992) |
| 1991 |
|---|
| 3 | | Vitit Kantabutra:
Designing optimum carry-skip adders.
IEEE Symposium on Computer Arithmetic 1991: 146-153 |
| 1986 |
|---|
| 2 | | Vitit Kantabutra,
S. Rao Kosaraju:
New Algorithms for Multilink Robot Arms.
J. Comput. Syst. Sci. 32(1): 136-153 (1986) |
| 1983 |
|---|
| 1 | | Vitit Kantabutra:
Traveling Salesman Cycles are not Always Subgraphs of Voronoi Duals.
Inf. Process. Lett. 16(1): 11-12 (1983) |
Data released under the ODC-BY 1.0 license — See also our legal information page