Proceedings 35th Annual Symposium on Foundations of Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By IEEE Comput. Soc. Press

0818665807

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Fast and feasible periodic sorting networks of constant depth

Proceedings 35th Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.1994.365679 ◽

2002 ◽

Cited By ~ 3

Author(s):

M. Kutylowski ◽

K. Lorys ◽

B. Oesterdiekhoff ◽

R. Wanka

Keyword(s):

Constant Depth ◽

Sorting Networks

An efficient membership-query algorithm for learning DNF with respect to the uniform distribution

Proceedings 35th Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.1994.365706 ◽

2002 ◽

Cited By ~ 24

Author(s):

J. Jackson

Keyword(s):

Uniform Distribution ◽

Membership Query ◽

Query Algorithm

Graph connectivity and monadic NP

Proceedings 35th Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.1994.365730 ◽

2002 ◽

Cited By ~ 11

Author(s):

T. Schwentick

Keyword(s):

Graph Connectivity

Expander codes

Proceedings 35th Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.1994.365734 ◽

2002 ◽

Cited By ~ 15

Author(s):

M. Sipser ◽

D.A. Spielman

Keyword(s):

Expander Codes

Randomness-efficient oblivious sampling

Proceedings 35th Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.1994.365687 ◽

2002 ◽

Cited By ~ 52

Author(s):

M. Bellare ◽

J. Rompel

On learning discretized geometric concepts

Proceedings 35th Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.1994.365705 ◽

2002 ◽

Cited By ~ 7

Author(s):

N.H. Bshouty ◽

Zhixiang Chen ◽

S. Homer

Keyword(s):

Geometric Concepts

Complexity lower bounds for computation trees with elementary transcendental function gates

Proceedings 35th Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.1994.365736 ◽

2002 ◽

Cited By ~ 2

Author(s):

D. Grigoriev ◽

N. Vorobjov

Keyword(s):

Lower Bounds ◽

Transcendental Function ◽

Complexity Lower Bounds ◽

Computation Trees

Polynomial time randomised approximation schemes for the Tutte polynomial of dense graphs

Proceedings 35th Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.1994.365708 ◽

2002 ◽

Cited By ~ 3

Author(s):

N. Alon ◽

A. Frieze ◽

D. Welsh

Keyword(s):

Polynomial Time ◽

Tutte Polynomial ◽

Approximation Schemes ◽

Dense Graphs

Program result-checking: a theory of testing meets a test of theory

Proceedings 35th Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.1994.365678 ◽

2002 ◽

Cited By ~ 12

Author(s):

M. Blum ◽

H. Wasserman

On-line admission control and circuit routing for high performance computing and communication

Proceedings 35th Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.1994.365675 ◽

2002 ◽

Cited By ~ 34

Author(s):

B. Awerbuch ◽

R. Gawlick ◽

T. Leighton ◽

Y. Rabani

Keyword(s):

High Performance Computing ◽

Admission Control ◽

High Performance ◽

On Line ◽

Performance Computing

Proceedings 35th Annual Symposium on Foundations of Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By IEEE Comput. Soc. Press

Fast and feasible periodic sorting networks of constant depth

An efficient membership-query algorithm for learning DNF with respect to the uniform distribution

Graph connectivity and monadic NP

Expander codes

Randomness-efficient oblivious sampling

On learning discretized geometric concepts

Complexity lower bounds for computation trees with elementary transcendental function gates

Polynomial time randomised approximation schemes for the Tutte polynomial of dense graphs

Program result-checking: a theory of testing meets a test of theory

On-line admission control and circuit routing for high performance computing and communication

Proceedings 35th Annual Symposium on Foundations of Computer Science
Latest Publications