scispace - formally typeset
Open AccessProceedings ArticleDOI

On the red-blue set cover problem

Reads0
Chats0
TLDR
Backside FIB technology was used to prepare an IC for inspection of voided metal interconnects and vias and clarified how the voids were formed, helping to identify the IC process steps that needed to be changed.
Abstract
Both the increased complexity of integrated circuits, resulting in six or more levels of integration, and the increasing use of flip-chip packaging have driven the development of integrated circuit (IC) failure analysis tools that can be applied to the backside of the chip. Among these new approaches are focused ion beam (FIB) tools and processes for performing chip edits/repairs from the die backside. This paper describes the use of backside FIB for a failure analysis application rather than for chip repair. Specifically, we used FIB technology to prepare an IC for inspection of voided metal interconnects (''lines'') and vias. Conventional FIB milling was combined with a super-enhanced gas assisted milling process that uses XeF{sub 2} for rapid removal of large volumes of bulk silicon. This combined approach allowed removal of the TiW underlayer from a large number of Ml lines simultaneously, enabling rapid localization and plan view imaging of voids in lines and vias with backscattered electron (BSE) imaging in a scanning electron microscope (SEM). Sequential cross sections of individual voided vias enabled us to develop a 3-d reconstruction of these voids. This information clarified how the voids were formed, helping us identify the IC process steps that needed tomore » be changed.« less

read more

Content maybe subject to copyright    Report

Citations
More filters
Proceedings ArticleDOI

Adaptive Blocking: Learning to Scale Up Record Linkage

TL;DR: This paper introduces an adaptive framework for automatically learning blocking functions that are efficient and accurate, and describes two predicate-based formulations of learnable blocking functions and provides learning algorithms for training them.
Proceedings ArticleDOI

(1 + εΒ)-spanner constructions for general graphs

Michael Elkin, +1 more
TL;DR: In this article, it was shown that the multiplicative factor can be made arbitrarily close to 1 while keeping the spanner size arbitrary close to O(n), at the cost of allowing the additive term to be a sufficiently large constant.
Proceedings ArticleDOI

Minimum-color path problems for reliability in mesh networks

TL;DR: This work considers the problem of maximizing the reliability of connections in mesh networks against failure scenarios in which multiple links may fail simultaneously, and considers the single-path connection problem as well as multiple-path (protected) connection problems.
Proceedings ArticleDOI

Synthesizing view definitions from data

TL;DR: This work addresses the view definitions problem (VDP): Find the most succinct and accurate view definition, when the view query is restricted to a specific family of queries.
Journal ArticleDOI

Shared Risk Resource Group : Complexity and Approximability Issues

TL;DR: Cases where combinatorial optimization problems are polynomial are identified, for example when the edges of a given color form a connected subgraph, and otherwise hardness and non approximability results for these problems are identified.
References
More filters
Journal ArticleDOI

On a routing problem

TL;DR: Given a set of N cities, with every two linked by a road, and the times required to traverse these roads, the functional equation technique of dynamic programming and approximation in policy space yield an iterative algorithm which converges after at most (N-1) iterations.
Journal ArticleDOI

Approximation algorithms for combinatorial problems

TL;DR: For the problem of finding the maximum clique in a graph, no algorithm has been found for which the ratio does not grow at least as fast as n^@e, where n is the problem size and @e>0 depends on the algorithm.
Proceedings ArticleDOI

How to use expert advice

TL;DR: This work analyzes algorithms that predict a binary value by combining the predictions of several prediction strategies, called `experts', and shows how this leads to certain kinds of pattern recognition/learning algorithms with performance bounds that improve on the best results currently known in this context.
Proceedings ArticleDOI

Approximation algorithms for directed Steiner problems

TL;DR: The first non-trivial approximation algorithms for the Steiner Tree problem and the Generalized Steiner tree problem in general directed graphs are obtained.
Journal ArticleDOI

A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem

TL;DR: A randomized algorithm with a polylogarithmic approximation guarantee for the group Steiner tree problem was given in this paper, running in time O(nik2i) in the worst case.