Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Yap, Chee K."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Complete subdivision algorithms, II: Isotopic meshing of singular algebraic curves
Michael Burr
,
Sung Woo Choi
,
Ben Galehouse
,
Chee K. Yap
Journal Symbolic Computation
47
(2), 2012, pp. 131-152
Certified computation of planar Morse-Smale complexes
Amit Chattopadhyay
,
Gert Vegter
,
Chee K. Yap
Proceedings of the 28th Annual Symposium on Computational Geometry, SCG'2012 (Chapel Hill, NC, USA, June 17-20, 2012)
, 2012, pp. 259-268
Near optimal tree size bounds on a simple real root isolation algorithm
Vikram Sharma
,
Chee K. Yap
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, ISSAC'2012 (Grenoble, France, July 22-25, 2012)
, 2012, pp. 319-326
A simple but exact and efficient algorithm for complex root isolation
Michael Sagraloff
,
Chee K. Yap
Proceedings of the 36th International Symposium on Symbolic and Algebraic Computation, ISSAC'2011 (San Jose, CA, USA, June 8-11, 2011)
, 2011, pp. 353-360
Lower bounds for zero-dimensional projections
W. Dale Brownawell
,
Chee K. Yap
Proceedings of the 2009 International Symposium on Symbolic and Algebraic Computation, ISSAC'2009 (Seoul, Korea, July 28-31, 2009)
, 2009, pp. 79-86
Exact numerical computation in algebra and geometry
Chee K. Yap
Proceedings of the 2009 International Symposium on Symbolic and Algebraic Computation, ISSAC'2009 (Seoul, Korea, July 28-31, 2009)
, 2009, pp. 387-388
Complete subdivision algorithms, II: Isotopic meshing of singular algebraic curves
Michael Burr
,
Sung Woo Choi
,
Benjamin Galehouse
,
Chee K. Yap
Proceedings of the 2008 International Symposium on Symbolic and Algebraic Computation, ISSAC'2008 (Hagenberg, Austria, July 20-23, 2008)
, 2008, pp. 87-94
Almost tight recursion tree bounds for the Descartes method
Arno Eigenwillig
,
Vikram Sharma
,
Chee K. Yap
Proceedings of the 2006 International Symposium on Symbolic and Algebraic Computation, ISSAC'2006 (Università degli Studi di Genova, Genova, Italy, July 9-12, 2006)
, 2006, pp. 71-78
Constructive root bound for
k
-ary rational input numbers
Sylvain Pion
,
Chee K. Yap
Theoretical Computer Science
369
(1-3), 2006, pp. 361-376
k
-link shortest paths in weighted subdivisions
Ovidiu Daescu
,
Joseph S.B. Mitchell
,
Simeon Ntafos
,
James D. Palmer
,
Chee K. Yap
Lecture Notes in Computer Science
3608
, 2005, pp. 325-337
Robust approximate zeros
Vikram Sharma
,
Zilin Du
,
Chee K. Yap
Lecture Notes in Computer Science
3669
, 2005, pp. 874-886
Robust geometric computation
Chee K. Yap
Handbook of Discrete and Computational Geometry, 1997, pp. 653-668
Constructing the Voronoi diagram of a set of line segments in parallel
Michael T. Goodrich
,
Colm O'Dúnlaing
,
Chee K. Yap
Algorithmica
9
, 1993, pp. 128-141
Fast unimodular reduction: Planar integer lattices
Chee K. Yap
Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science, FOCS'92 (Pittsburgh, PA, October 24-27, 1992)
, 1992, pp. 437-446
A new lower bound construction for commutative Thue systems, with applications
Chee K. Yap
misc, 1990, January
Finding minimal convex nested polygons
Alok Aggarwal
,
Heather Booth
,
Joseph O'Rourke
,
Subhash Suri
,
Chee K. Yap
Information and Computation
83
(1), 1989, October, pp. 98-110
Constructing the Voronoi diagram of a set of line segments in parallel
Michael T. Goodrich
,
Colm Ó'Dúnlaing
,
Chee K. Yap
Lecture Notes in Computer Science
382
, 1989, pp. 12-23
A new lower bound construction for the word problem for commutative Thue systems
Chee K. Yap
Technical Report (416), 1988, November
A double exponential lower bound for degree-compatible Gröbner bases
Chee K. Yap
Technical Report (415), 1988, November