Abstract
Article Free Access Share on Multi-way partitioning via spacefilling curves and dynamic programming Authors: C. J. Alpert UCLA Computer Science Department, Los Angeles, CA UCLA Computer Science Department, Los Angeles, CAView Profile , A. B. Kahng UCLA Computer Science Department, Los Angeles, CA UCLA Computer Science Department, Los Angeles, CAView Profile Authors Info & Claims DAC '94: Proceedings of the 31st annual Design Automation ConferenceJune 1994 Pages 652–657https://doi.org/10.1145/196244.196603Online:06 June 1994Publication History 37citation351DownloadsMetricsTotal Citations37Total Downloads351Last 12 Months3Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Keywords
Affiliated Institutions
Related Publications
Spectral partitioning
Article Free Access Share on Spectral partitioning: the more eigenvectors, the better Authors: Charles J. Alpert UCLA Computer Science Department, Los Angeles, CA UCLA Computer ...
A control-theoretic approach to flow control
article Free Access Share on A control-theoretic approach to flow control Author: Srinivasan Keshav Computer Science Division, Department of EECS, University of California, Berk...
Low power signal processing architectures for network microsensors
Article Free Access Share on Low power signal processing architectures for network microsensors Authors: Michael J. Dong University of California, Los Angeles, Los Angeles, Cali...
Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems
article Free Access Share on Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems Authors: R. R. Muntz Computer Science Department, University of California, Los A...
An Algorithm for Finding Best Matches in Logarithmic Expected Time
article Free Access Share on An Algorithm for Finding Best Matches in Logarithmic Expected Time Authors: Jerome H. Friedman Stanford Linear Accelerator Center, Stanford Universi...
Publication Info
- Year
- 1994
- Type
- article
- Pages
- 652-657
- Citations
- 61
- Access
- Closed
External Links
Social Impact
Social media, news, blog, policy document mentions
Citation Metrics
Cite This
Identifiers
- DOI
- 10.1145/196244.196603