Leszek Gasieniec, Andrzej Lingas  Home/Search
Context
Related
| csc.liv.ac.uk/~leszek/pa...wads03.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: csc.liv.ac.uk/~leszek/pub (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We consider the problem of computing the product of two n n Boolean matrices A and B. (Update)
Similar documents based on text: More All
0.4: Constructing Evolutionary Trees - Algorithms And Complexity - Östlin (Correct)
0.4: Approximation Algorithms for Hamming Clustering Problems - Gasieniec, Jansson, Lingas (2000) (Correct)
0.3: Oblivious Gossiping in Ad-Hoc Radio Networks - Chlebus, Gasieniec, Lingas.. (2001) (Correct)
BibTeX entry: (Update)
@misc{ gasieniec-improved,
author = "Leszek Gasieniec and Andrzej Lingas",
title = "An improved bound on Boolean matrix multiplication for highly clustered
data",
url = "citeseer.ist.psu.edu/730734.html" }
Citations (may not include all citations):1450 The Design and Analysis of Computer Algorithms (context) - Aho, Hopcroft et al. - 1974
308 Matrix Multiplication via Arithmetic Progressions (context) - Coppersmith, Winograd - 1990
165 Approximate Nearest Neighbors: Towards Removing the Curse of.. - Indyk, Motwani - 1998
88 Data Structures and Algorithms 3: Multi-dimensional Searchin.. (context) - Mehlhorn - 1984
42 Cambridge University Press (context) - Cameron - 1994
26 Witnesses for Boolean Matrix Multiplication and Construction.. (context) - Alon, Naor - 1996
23 Subquadratic Approximation Algorithms For Clustering Problem.. - Borodin, Ostrovsky et al. - 1999
14 Witnesses for Boolean Matrix Multiplication and Shortest Pat.. (context) - Galil, Margalit - 1993
12 Ecient search for approximate nearest neighbor in high dimen.. (context) - Kushilevitz, Ostrovsky et al. - 1989
2 On reducing approximate mst to closest pair problems in high.. (context) - Indyk, Schmidt et al. - 1999
1 Combinatorial Algorithms for Boolean Matrix Product Witnesse.. (context) - Schnorr, Subramanian et al.
1 Fast Boolean matrix multiplication for highly clustered data (context) - Bj, Lingas - 2001
1 On Diameter Veri cation and Boolean Matrix Multiplication (context) - Basch, Khanna et al. - 1995
1 A geometric approach to Boolean matrix multiplication (context) - Lingas - 2002
Documents on the same site (http://www.csc.liv.ac.uk/~leszek/pub.html): More
Optimal Pattern Matching on Meshes - Chlebus, Gasieniec (1993) (Correct)
Constant-Space String Matching with Smaller Number of.. - Gasieniec.. (1995) (Correct)
Approximate Dictionary Queries - Brodal, Gasieniec (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC