scispace - formally typeset
L

L. Richard Carley

Researcher at Carnegie Mellon University

Publications -  69
Citations -  1630

L. Richard Carley is an academic researcher from Carnegie Mellon University. The author has contributed to research in topics: CMOS & Social network analysis. The author has an hindex of 20, co-authored 69 publications receiving 1553 citations.

Papers
More filters

KOAN/ANAGRAM 11: New Tools for Device-Level Analog Placement and Routing

TL;DR: In this article, the authors describe a new tool for device-level analog placement and routing called KOAN and ANAGRAM II, which uses general algorithmic techniques to find critical devicelevel layout optimizations rather than relying on a large library of fixed-topology module generators.
Journal ArticleDOI

Single-chip computers with microelectromechanical systems-based magnetic memory (invited)

TL;DR: The approach presented combines advances in the field of microelectromechanical systems (MEMS) and micromagnetics with traditional low-cost very-large-scale integrated circuit style parallel lithographic manufacturing for single-chip computer implementation.
Proceedings ArticleDOI

A 1.1V 50mW 2.5GS/s 7b Time-Interleaved C-2C SAR ADC in 45nm LP digital CMOS

TL;DR: A TI C-2C SAR ADC is presented that achieves high performance by using a small-area C- 2C SAR architecture with low input capacitance, high-speed boosted switches to overcome high device threshold, and redundant-ADC-based gain, offset and timing calibration to reduce TI errors.
Patent

Microelectromechanical structure and process of making same

TL;DR: In this article, a cantilevered beam is used as a memory device, which is constructed by providing an array of such beams proximate to a layer of media, and a control circuit generates control signals input to the positioning devices for positioning the tips according to x, y and z coordinates.
Proceedings ArticleDOI

Incremental algorithm for updating betweenness centrality in dynamically growing networks

TL;DR: The performance results suggest that the incremental betweenness algorithm can achieve substantial performance speedup, on the order of thousands of times, over the state of the art, including the best-performing non-incremental betweenness algorithms and a recently proposed betweenness update algorithm.