IEEE.org| IEEE Xplore Digital Library| IEEE Standards| IEEE Spectrum| More Sites

Cart (Loading....) | Create Account | Sign In

Author Search^beta | Advanced Search | Preferences | | More Search Options

Browse Conference Publications > Foundations of Computer Scienc ...

Foundations of Computer Science, 1986., 27th Annual Symposium on

| Create Account

IEEE Account

Change Username/Password
Update Address

Purchase Details

Payment Options
Order History
Access Purchased Documents

Profile Information

Communications Preferences
Profession and Education
Technical Interests

Need Help?

US & Canada: +1 800 678 4333
Worldwide: +1 732 981 0060
Contact & Support

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.

Please enter a valid username or password.

For Institutional Users:

More Search Options

Foundations of Computer Science, 1986., 27th Annual Symposium on

Date 27-29 Oct. 1986

Quick Links

Filter Results

You have selected:

Title History

[Front cover]

Table of contents

Foreword

Machtey award

An O(n2(m + n log n) log n) min-cost flow algorithm

Probabilistic construction of deterministic algorithms: Approximating packing integer programs

On a search problem related to branch-and-bound procedures

Probabilistic Boolean decision trees and the complexity of evaluating game trees

A physical interpretation of graph connectivity, and its algorithmic applications

The asymptotic spectrum of tensors and the exponent of matrix multiplication

Storing a dynamic sparse table

Lower bounds for accessing binary search trees with rotations

What search algorithm gives optimal average-case performance when search resources are highly limited?

Geometric applications of Davenport-Schinzel sequences

Lower bounds on the complexity of multidimensional searching

Planar realizations of nonlinear Davenport-Schinzel sequences by segments

Proving by example and gap theorems

An optimal algorithm for the all-nearest-neighbors problem

An algorithm for constructing the aspect graph

An algorithmic approach to the automated design of parts orienters

Finite-resolution computational geometry

On Newton's method for polynomials

How to generate and exchange secrets

Information theoretic reductions among disclosure problems

Proofs that yield nothing but their validity and a methodology of cryptographic protocol design

IEEE Account

Purchase Details

Profile Information

Need Help?