26th Annual Symposium on Foundations of Computer Science (sfcs 1985)
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By IEEE

0818606444

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Geometrical realization of set systems and probabilistic communication complexity

26th Annual Symposium on Foundations of Computer Science (sfcs 1985) ◽

10.1109/sfcs.1985.30 ◽

1985 ◽

Cited By ~ 34

Author(s):

N. Alon ◽

P. Frankl ◽

V. Rodl

Keyword(s):

Communication Complexity ◽

Set Systems ◽

Geometrical Realization

Download Full-text

Average case lower bounds on the construction and searching of partial orders

26th Annual Symposium on Foundations of Computer Science (sfcs 1985) ◽

10.1109/sfcs.1985.13 ◽

1985 ◽

Cited By ~ 1

Author(s):

Harry G. Mairson

Keyword(s):

Lower Bounds ◽

Partial Orders ◽

Average Case

Download Full-text

Distributed BFS algorithms

26th Annual Symposium on Foundations of Computer Science (sfcs 1985) ◽

10.1109/sfcs.1985.20 ◽

1985 ◽

Cited By ~ 22

Author(s):

Baruch Awerbuch ◽

Robert G. Gallager

Download Full-text

26th Annual Symposium on Foundations of Computer Science (sfcs 1985) ◽

10.1109/sfcs.1985.54 ◽

1985 ◽

Download Full-text

Collective coin flipping, robust voting schemes and minima of Banzhaf values

26th Annual Symposium on Foundations of Computer Science (sfcs 1985) ◽

10.1109/sfcs.1985.15 ◽

1985 ◽

Cited By ~ 27

Author(s):

Michael Ben-Or ◽

Nathan Linial

Keyword(s):

Coin Flipping

Download Full-text

Separating the polynomial-time hierarchy by oracles

26th Annual Symposium on Foundations of Computer Science (sfcs 1985) ◽

10.1109/sfcs.1985.49 ◽

1985 ◽

Cited By ~ 188

Author(s):

Andrew Chi-Chih Yao

Keyword(s):

Polynomial Time ◽

Polynomial Time Hierarchy

Download Full-text

A robust and verifiable cryptographically secure election scheme

26th Annual Symposium on Foundations of Computer Science (sfcs 1985) ◽

10.1109/sfcs.1985.2 ◽

1985 ◽

Cited By ~ 175

Author(s):

Josh D. Cohen ◽

Michael J. Fischer

Download Full-text

Amplification of probabilistic boolean formulas

26th Annual Symposium on Foundations of Computer Science (sfcs 1985) ◽

10.1109/sfcs.1985.5 ◽

1985 ◽

Cited By ~ 10

Author(s):

Ravi B. Boppana

Keyword(s):

Boolean Formulas

Download Full-text

Dynamic monotone priorities on planar sets

26th Annual Symposium on Foundations of Computer Science (sfcs 1985) ◽

10.1109/sfcs.1985.21 ◽

1985 ◽

Author(s):

Michael J. Fischer ◽

Michael S. Paterson

Download Full-text

An all pairs shortest path algorithm with expected running time O(n 2logn)

26th Annual Symposium on Foundations of Computer Science (sfcs 1985) ◽

10.1109/sfcs.1985.6 ◽

1985 ◽

Cited By ~ 2

Author(s):

Alistair Moffat ◽

Tadao Takaoka

Keyword(s):

Shortest Path ◽

Shortest Path Algorithm ◽

Running Time ◽

All Pairs Shortest Path

Download Full-text

26th Annual Symposium on Foundations of Computer Science (sfcs 1985)
Latest Publications

TOTAL DOCUMENTS

H-INDEX

Published By IEEE

Geometrical realization of set systems and probabilistic communication complexity

Average case lower bounds on the construction and searching of partial orders

Distributed BFS algorithms

Table of contents

Collective coin flipping, robust voting schemes and minima of Banzhaf values

Separating the polynomial-time hierarchy by oracles

A robust and verifiable cryptographically secure election scheme

Amplification of probabilistic boolean formulas

Dynamic monotone priorities on planar sets

An all pairs shortest path algorithm with expected running time O(n 2logn)

Export Citation Format

26th Annual Symposium on Foundations of Computer Science (sfcs 1985)Latest Publications

TOTAL DOCUMENTS

H-INDEX

Published By IEEE

Geometrical realization of set systems and probabilistic communication complexity

Average case lower bounds on the construction and searching of partial orders

Distributed BFS algorithms

Table of contents

Collective coin flipping, robust voting schemes and minima of Banzhaf values

Separating the polynomial-time hierarchy by oracles

A robust and verifiable cryptographically secure election scheme

Amplification of probabilistic boolean formulas

Dynamic monotone priorities on planar sets

An all pairs shortest path algorithm with expected running time O(n 2logn)

26th Annual Symposium on Foundations of Computer Science (sfcs 1985)
Latest Publications