Algorithms | Sciweavers

83

CIAC
2010
Springer

262views Algorithms» more CIAC 2010»

Graph unique-maximum and conflict-free colorings

14 years 10 months ago

We investigate the relationship between two kinds of vertex colorings of graphs: uniquemaximum colorings and conflict-free colorings. In a unique-maximum coloring, the colors are ...

Panagiotis Cheilaris and Géza Tóth

claim paper

Read More »

41

click to vote

STOC
1987
ACM

64views Algorithms» more STOC 1987»

On Learning Boolean Functions

14 years 10 months ago

Download www.ri.cmu.edu

B. K. Natarajan

claim paper

Read More »

35

click to vote

STOC
1987
ACM

56views Algorithms» more STOC 1987»

Matching Is as Easy as Matrix Inversion

14 years 10 months ago

Download www.cc.gatech.edu

Ketan Mulmuley, Umesh V. Vazirani, Vijay V. Vazira...

claim paper

Read More »

36

click to vote

STOC
1987
ACM

45views Algorithms» more STOC 1987»

A New Graph Triconnectivity Algorithm and Its Parallelization

14 years 10 months ago

Download www.cs.cmu.edu

Gary L. Miller, Vijaya Ramachandran

claim paper

Read More »

32

click to vote

STOC
1987
ACM

52views Algorithms» more STOC 1987»

On the Learnability of Boolean Formulae

14 years 10 months ago

Download www.cis.upenn.edu

Michael J. Kearns, Ming Li, Leonard Pitt, Leslie G...

claim paper

Read More »

46

click to vote

STOC
1987
ACM

110views Algorithms» more STOC 1987»

How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority

14 years 10 months ago

Download www.jos.org.cn

Oded Goldreich, Silvio Micali, Avi Wigderson

claim paper

Read More »

46

click to vote

STOC
1987
ACM

104views Algorithms» more STOC 1987»

The Boolean Formula Value Problem Is in ALOGTIME

14 years 10 months ago

Download euclid.ucsd.edu

The Boolean formula value problem is in alternating log time and, more generally, parenthesis context-free languages are in alternating log time. The evaluation of reverse Polish ...

Samuel R. Buss

claim paper

Read More »

47

click to vote

STOC
1987
ACM

46views Algorithms» more STOC 1987»

Size-Time Complexity of Boolean Networks for Prefix Computations

14 years 10 months ago

Download www.cs.brown.edu

Gianfranco Bilardi, Franco P. Preparata

claim paper

Read More »

53

click to vote

STOC
1987
ACM

82views Algorithms» more STOC 1987»

Permutation Groups in NC

14 years 10 months ago

Download ix.cs.uoregon.edu

We show that the basic problems of permutation group manipulation admit e cient parallel solutions. Given a permutation group G by a list of generators, we nd a set of NC-e cient ...

László Babai, Eugene M. Luks, &Aacut...

claim paper

Read More »

42

click to vote

FODO
1989
Springer

89views Algorithms» more FODO 1989»

A Formal Definition of Binary Topological Relationships

14 years 10 months ago

Download www.spatial.maine.edu

Max J. Egenhofer

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers