Bell Labs

About: Bell Labs is a based out in . It is known for research contribution in the topics: Laser & Optical fiber. The organization has 36499 authors who have published 59862 publications receiving 3190823 citations. The organization is also known as: Bell Laboratories & AT&T Bell Laboratories.

The Design and Evolution of C

Abstract: PART I. 1. The Prehistory of C++ . 2. C with Classes. 3. The Birth of C++. 4. C++ Language Design Rules. 5. Chronology 1985-1993. 6. Standardization. 7. Interest and Use. 8. Libraries. 9. Looking Ahead. PART II. 1. Memory Management. 2. Overloading. 3. Multiple Inheritance. 4. Class Concept Refinements. 5. Casting. 6. Templates. 7. Exception Handling. 8. Namespaces. 9. The C Preprocessor. Index. 0201543303T04062001

Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons

Abstract: Given a triangulation of a simple polygonP, we present linear-time algorithms for solving a collection of problems concerning shortest paths and visibility withinP. These problems include calculation of the collection of all shortest paths insideP from a given source vertexS to all the other vertices ofP, calculation of the subpolygon ofP consisting of points that are visible from a given segment withinP, preprocessingP for fast "ray shooting" queries, and several related problems.

The benefits of relaxing punctuality

Abstract: The most natural, compositional, way of modeling real-time systems uses a dense domain for time. The satisfiability of timing constraints that are capable of expressing punctuality in this model, however, is known to be undecidable. We introduce a temporal language that can constrain the time difference between events only with finite, yet arbitrary, precision and show the resulting logic to be EXPSPACE-complete. This result allows us to develop an algorithm for the verification of timing properties of real-time systems with a dense semantics.

Efficient algorithms for finding minimum spanning trees in undirected and directed graphs

Abstract: Recently, Fredman and Tarjan invented a new, especially efficient form of heap (priority queue). Their data structure, theFibonacci heap (or F-heap) supports arbitrary deletion inO(logn) amortized time and other heap operations inO(1) amortized time. In this paper we use F-heaps to obtain fast algorithms for finding minimum spanning trees in undirected and directed graphs. For an undirected graph containingn vertices andm edges, our minimum spanning tree algorithm runs inO(m logβ (m, n)) time, improved fromO(mβ(m, n)) time, whereβ(m, n)=min {i|log(i) n ≦m/n}. Our minimum spanning tree algorithm for directed graphs runs inO(n logn + m) time, improved fromO(n log n +m log log log(m/n+2) n). Both algorithms can be extended to allow a degree constraint at one vertex.