Search Sciweavers | Sciweavers

71

IPL
2006

100views more IPL 2006»

Strong normalization proofs by CPS-translations

14 years 10 months ago

In this paper, we propose a new proof method for strong normalization of calculi with control operators, and, by this method, we prove strong normalization of the system

Satoshi Ikeda, Koji Nakazawa

claim paper

Read More »

68

click to vote

IPL
2006

105views more IPL 2006»

Finding and counting cliques and independent sets in r-uniform hypergraphs

14 years 10 months ago

Download research.haifa.ac.il

We present a matrix multiplication based algorithm for counting the number of (induced) occurrences of a fixed r-uniform hypergraph in a larger hypergraph. In many cases, the runn...

Raphael Yuster

claim paper

Read More »

77

click to vote

IPL
2006

139views more IPL 2006»

An adjustable linear time parallel algorithm for maximum weight bipartite matching

14 years 10 months ago

Download www.ece.neu.edu

We present a parallel algorithm for finding a maximum weight matching in general bipartite graphs with an adjustable time complexity of O(n ) using O(nmax(2,4+)) processing

Morteza Fayyazi, David R. Kaeli, Waleed Meleis

claim paper

Read More »

38

Voted

IPL
2006

72views more IPL 2006»

Acyclic colorings of products of trees

14 years 10 months ago

Download www.math.clemson.edu

We obtain bounds for the coloring numbers of products of trees for three closely related types of colorings: acyclic, distance 2, and L(2, 1).

Robert E. Jamison, Gretchen L. Matthews, John Vill...