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"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Amortized analysis of smooth quadtrees in all dimensions
Huck Bennett
,
Chee Yap
Lecture Notes in Computer Science
8503
, 2014, pp. 38-49
On soft predicates in subdivision motion planning
Cong Wang
,
Yi-Jen Chiang
,
Chee Yap
Proceedings of the 29th Annual ACM Symposium on Computional Geometry, SoCG'2013 (Rio de Janeiro, Brazil, June 17-20, 2013)
, 2013, pp. 349-358
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
Complete numerical isolation of real roots in zero-dimensional triangular systems
Jin-San Cheng
,
Xiao-Shan Gao
,
Chee-Keng Yap
Journal Symbolic Computation
44
(7), 2009, pp. 768-785
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
Complete numerical isolation of real zeros in zero-dimensional triangular systems
Jin-San Cheng
,
Xiao-Shan Gao
,
Chee-Keng Yap
Proceedings of the 2007 International Symposium on Symbolic and Algebraic Computation, ISSAC'2007 (Waterloo, Ontario, Canada, July 29 - August 01, 2007)
, 2007, pp. 92-99
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
Classroom examples of robustness problems in geometric computations
Lutz Kettner
,
Kurt Mehlhorn
,
Sylvain Pion
,
Stefan Schirra
,
Chee Yap
Lecture Notes in Computer Science
3221
, 2004, pp. 702-713
Competitive online scheduling with level of service
Ee-Chien Chang
,
Chee Yap
Lecture Notes in Computer Science
2108
, 2001, pp. 453-462
Smallest enclosing cylinders
E. Schömer
,
J. Sellen
,
M. Teichmann
,
Chee Yap
Algorithmica
27
(2), 2000, pp. 170-186
Precision-sensitive Euclidean shortest path in 3-space
Jürgen Sellen
,
Joonsoo Choi
,
Chee-Keng Yap
SIAM Journal on Computing
29
(5), 2000, pp. 1577-1595
Fundamental Problems of Algorithmic Algebra
Chee Keng Yap
Buch, 2000, pp. xv, 511
Robust geometric computation
Chee K. Yap
Handbook of Discrete and Computational Geometry, 1997, pp. 653-668
The Habicht approach to subresultants
Chung-Jen Ho
,
Chee Keng Yap
Journal Symbolic Computation
21
(1), 1996, pp. 1-14
Output-sensitive construction of polytopes in four dimensions and clipped Voronoi diagrams in three
Timothy M.Y. Chan
,
Jack Snoeyink
,
Chee-Keng Yap
Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'95 (San Francisdo, California, January 22-24, 1995)
, 1995, pp. 282-291
A note on improved deterministic time simulation of nondeterministic space for small space
Ee-Chien Chang
,
Chee Yap
Information Processing Letters
55
, 1995, pp. 155-157
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
Seiten 1
2
>