J. Ullman, "Computational Aspects of VLSI," Computer Science Press, Rockville, MD, 1984. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Applications of the Crossing Number - Pach, Shahrokhi, Szegedy (1996) (15 citations) (Correct)
.... V (G) and V 2 = V (H 2 ) V (G) have at least n=3 elements. b(G) jE(V 1 ; V 2 )j 1:58 and the result follows. 2 In the special case when every vertex of G is of degree at most 4, Theorem 2. 1 was established by Leighton [L] and it proved to be an important tool in VLSI design (see [U]) 3 Geometric graphs The aim of this section is to prove the following generalization of Theorem 1.1 for curvilinear graphs. Theorem 3.1 Let G be a graph with n vertices that has a drawing with Jordan arcs such that no arc passes through any vertex other than its endpoints, no two arcs meet in ....
J.P. Ullman, Computational Aspects of VLSI, Comp. Sci. Press, Rockville, Maryland, 1984. 11
The Complexity of Design Automation Problems - Sahni, Bhatt, Raghavan (1980) (5 citations) (Correct)
....design problems, some of which are similar to problems encountered earlier, and some that have no counterpart in MSI LSI based design styles. W. M. van Cleemput [CLEE76] has compiled a detailed bibliography on DA related disciplines. The computational aspects of VLSI design are studied in the book [ULLM84]. David Johnson s ongoing column The NP Completeness Column in the Journal of Algorithms, Academic Press, is a good source for current research on NP completeness. In fact, the Dec. 1982 column is devoted to routing problems, JOHN82] 2. SOME DESIGN AUTOMATION PROBLEMS There are numerous ....
Ullman, J., Computational Aspects of VLSI, Computer Science Press, Maryland, 1984.
On Dynamic Algorithms for Algebraic Problems - Reif, R. (1997) (5 citations) (Correct)
.... this property is the class of normal hypercube algorithms [16] originally called ASCEND DESCEND algorithms [18] which includes efficient algorithms for matrix multiplication and several popular parallel sorting algorithms such as odd even merge sort, bitonic sort, and flash sort (see [16] or [23] for further details) Another large class of algorithms that has the desired regularity property is the class of algorithms constructed using tensor product factorizations [13] which includes many of the transform computa tions used in signal processing. For these classes of problems, and ....
J. Ullman, "Computational Aspects of VLSI," Cornput. Sci. Press, Rockville, MD, 1984.
Memory in Motion: A Study of Storage Structures in QCA - Frost, Rodrigues.. (2002) (1 citation) (Correct)
....gate must necessarily be low in all such cases. 3.6. Density and Latency Another benefit of the recursive H structure is its scalability. A general H tree layout is highly packed and consumes area O(n) where n is the number of words stored and the maximum wire length is bounded by O( # n)[15]. We have completed and simulated a detailed H memory comprised of 256 12 bit words. This design exhibits a density of 218 cell bit. With a 12 bit word, only 8.5 of the total memory area is comprised of memory loop area. The bulk Data Out Read Enable Write Enable Select Address Data ....
J. Ullman. Computational Aspects of VLSI, chapter 3. Computer Science Press, 1984.
On Dynamic Algorithms for Algebraic Problems - John Reif Department (Correct)
No context found.
J. Ullman, "Computational Aspects of VLSI," Computer Science Press, Rockville, MD, 1984.
The Challenges and Opportunities of Nanoelectronics - Seth Copen Goldstein (Correct)
No context found.
J.D. Ullman. Computational Aspects of VLSI. Computer Science Press, 1984.
Figure 13. Decoupling Capacitance Hierarchy - Board Power Supply (Correct)
No context found.
J. Ullman, "Computational Aspects of VLSI", Computer Science Poress, Rockville, 1984.
Compact Data Structures with Fast Queries - Blandford (2005) (Correct)
No context found.
J. D. Ullman. Computational Aspects of VLSI. Computer Science Press, Rockville, MD, 1984.
Fundamenta Informaticae 52 (2002) 1--11 1 - Ios Press Simple (Correct)
No context found.
Ullman J.D., Computational Aspects of VLSI. Computer Science Press, 1984.
Radial Level Planarity Testing and Embedding in.. - Bachmaier.. (2004) (2 citations) (Correct)
No context found.
J. D. Ullman. Computational Aspects of VLSI, chapter 3.5, pages 111--114. Computer Science Press, 1984.
Radial Level Planarity Testing and Embedding in Linear Time - Bachmaier, Brandenburg.. (2005) (2 citations) (Correct)
No context found.
J. D. Ullman. Computational Aspects of VLSI, chapter 3.5, pages 111--114. Computer Science Press, 1984.
Radial Level Planarity Testing and Embedding in Linear Time - Bachmaier, Brandenburg.. (2003) (2 citations) (Correct)
No context found.
J. D. Ullman. Computational Aspects of VLSI, chapter 3.5, pages 111--114. Computer Science Press, 1984.
Parallel Algorithm for Linked List and Beyond - Han (1990) (Correct)
No context found.
. J. D. Ullman. Computational aspects of VLSI, Computer Science Press, 1984.
Parallel Algorithms for Computing Linked List Prefix - Han (1989) (Correct)
No context found.
Ullman, J. D. Computational Aspects of VLSI. Computer Science Press, 1984.
Stability, Fairness and Scalability of Multi-Agent Systems - De Wilde, Nwana, Lee (Correct)
No context found.
J. D. Ullman. Computational Aspects of VLSI. Computer Science Press, Rockville, Maryland, 1984.
An Experimental Analysis of a Compact Graph Representation - Blandford, Blelloch, Kash (2004) (Correct)
No context found.
J. D. Ullman. Computational Aspects of VLSI. Computer Science Press, Rockville, MD, 1984.
Cost Performance Optimizations of Microprocessors - Fu (2001) (1 citation) (Correct)
No context found.
J. D. Ullman, Computational Aspects of VLSI, Computer Science Press, 1984.
Radial Level Planarity Testing - And Embedding In (Correct)
No context found.
J. D. Ullman. Computational Aspects of VLSI, chapter 3.5, pages 111--114. Computer Science Press, 1984.
On the Complexity of VLSI Implementations and Graph.. - Bryant (1998) (159 citations) (Correct)
No context found.
J. D. Ullman, Computational Aspects of VLSI, Computer Science Press, 1983. 20
Viable Architectures for High-Performance Computing - Ziavras, Wang, Papathanasiou (2003) (Correct)
No context found.
Ullman, J. D. (1984) Computational Aspects of VLSI. Computer Science Press, Rockville, MD.
Radial Level Planarity Testing and Embedding in Linear Time - Bachmaier, Brandenburg.. (2005) (2 citations) (Correct)
No context found.
J. D. Ullman. Computational Aspects of VLSI, chapter 3.5, pages 111--114. Computer Science Press, 1984.
Computer Science 7377 January 18, 2001 - Lecture Interconnection Networks (Correct)
No context found.
Jeffrey D. Ullman. Computational Aspects of VLSI. Computer Sciences Press, 1984.
Radial Level Planarity Testing and Embedding in Linear Time - Bachmaier, Brandenburg.. (2003) (2 citations) (Correct)
No context found.
J. D. Ullman. Computational Aspects of VLSI, chapter 3.5, pages 111--114. Computer Science Press, 1984.
Parallel Divide and Conquer on Meshes - Lo Computer Science (1996) (1 citation) (Correct)
No context found.
J.D. Ullman. Computational Aspects of VLSI. Computer Science Press, Rockville, MD, 1984.
Delay-Optimal Technology Mapping for - Heterogeneous Luts Jason (1998) (Correct)
No context found.
J.D. Ullman, "Computational Aspects of VLSI", Computer Sci- ence Press Inc, Rockville MD, 1983.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC