Publications

Export 1435 results:
Author Title Type [ Year(Asc)]
Filters: First Letter Of Last Name is K  [Clear All Filters]
1992
Voytas DF, Cummings MP, Koniczny A, Ausubel FM, Rodermel SR.  1992.  copia-like retrotransposons are ubiquitous among plants. Proc Natl Acad Sci USA. 89(15):7124-7128.
Greenberg R, JaJa JF, Krishnamurthy S.  1992.  On the difficulty of Manhattan channel routing. Information Processing Letters. 44(5):281-284.
Aggarwal A, Bar-Noy A, Khuller S, Kravets D, Schieber B.  1992.  Efficient minimum cost matching using quadrangle inequality. Foundations of Computer Science, 1992. Proceedings., 33rd Annual Symposium on. :583-592.
Aggarwal A, Bar-Noy A, Khuller S, Kravets D, Schieber B.  1992.  Efficient minimum cost matching using quadrangle inequality. Foundations of Computer Science, 1992. Proceedings., 33rd Annual Symposium on. :583-592.
Fermüller C, Kropatsch W.  1992.  Hierarchical curve representation. , 11th IAPR International Conference on Pattern Recognition, 1992. Vol.III. Conference C: Image, Speech and Signal Analysis, Proceedings. :143-146.
Kao TC, Mount D.  1992.  Incremental construction and dynamic maintenance of constrained Delaunay triangulations. Proceedings of the 4th Canadian Conference on Computational Geometry. :170-175.
Khuller S, Schieber B.  1992.  On independent spanning trees. Information Processing Letters. 42(6):321-323.
Fermüller C, Kropatsch W.  1992.  Multi-resolution shape description by corners. , 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 1992. Proceedings CVPR '92. :271-276.
Chandran S, Kim SK, Mount D.  1992.  Parallel computational geometry of rectangles. Algorithmica. 7(1):25-49.
Khuller S, Mitchell SG, Vazirani VV.  1992.  Processor efficient parallel algorithms for the two disjoint paths problem and for finding a Kuratowski homeomorph. SIAM Journal on Computing. 21:486-486.
Yu S-S, Kolagotla RK, JaJa JF.  1992.  VLSI Architectures and Implementation of Predictive Tree- Searched Vector Quantizers for Real-Time Video Compression. ISR-TR-1992-48
Chiu C-T, Kolagotla RK, Liu RKJ, JaJa JF.  1992.  VLSI Implementation of Real-Time Parallel DCT/DST Lattice Structures for Video. ISR-TR-1992-34
1991
Kao TC, Mount D.  1991.  Computing generalized Voronoi diagrams in improved time and space bounds.
Kraus S, Nirkhe M, Perlis D.  1991.  Deadline-coupled real-time planning. Innovative approaches to planning, scheduling and control: proceedings of a Workshop [on Innovative Approaches to Planning, Scheduling, and Control], held at San Diego, California, November 5-8, 1991. :100-100.
Shneiderman B, Kreitzberg C, Berk E.  1991.  Editing to structure a reader's experience. Hypertext/hypermedia handbookHypertext/hypermedia handbook. :143-164.
Nirkhe M, Kraus S, Perlis D.  1991.  Fully deadline-coupled planning: One step at a time. Methodologies for Intelligent Systems. :589-599.
Etherington DW, Kraus S, Perlis D.  1991.  Nonmonotonicity and the scope of reasoning. Artificial Intelligence. 52(3):221-261.
Roussopoulos N, Kang H.  1991.  A pipeline N-way join algorithm based on the 2-way semijoin program. IEEE Transactions on Knowledge and Data Engineering. 3(4):486-495.
Khuller S, Vazirani VV.  1991.  Planar graph coloring is not self-reducible, assuming P ≠ NP. Theoretical Computer Science. 88(1):183-189.
Kurkulos M, Weinberg JM, Pepling ME, Mount SM.  1991.  Polyadenylylation in copia requires unusually distant upstream sequences. Proceedings of the National Academy of SciencesPNAS. 88(8):3038-3042.
Kraus S, Perlis D, Horty JF.  1991.  Reasoning about ignorance: A note on the Bush-Gorbachev problem. Fundam. Inform.. 15(3-4):325-332.
Konieczny A, Voytas DF, Cummings MP, Ausubel FM.  1991.  A superfamily of ıt Arabidopsis thaliana retrotransposons. Genetics. 127(4):801-809.
1990
Khuller S.  1990.  Coloring algorithms for K5-minor free graphs. Information Processing Letters. 34(4):203-208.
Krishnamurthy S, JaJa JF.  1990.  An efficient parallel algorithm for channel routing. Computer Design: VLSI in Computers and Processors, 1990. ICCD '90. Proceedings., 1990 IEEE International Conference on. :400-403.
Khuller S.  1990.  Extending planar graph algorithms to K3,3-free graphs. Information and Computation. 84(1):13-25.

Pages