1017 search results - page 190 / 204 » Some existence and construction results of polygonal designs |
STOC
2010
ACM
14 years 4 months ago
2010
ACM
We initiate a direction for proving lower bounds on the size of non-commutative arithmetic circuits. This direction is based on a connection between lower bounds on the size of no...
SIGSOFT
2008
ACM
14 years 8 months ago
2008
ACM
We observed a general problem of sequential programs, which often results in design and programming errors in industrial software engineering projects, and propose a solution appr...
GD
1998
Springer
13 years 11 months ago
1998
Springer
We demonstrate the H3Viewer graph drawing library, which can be run from a standalone program or in conjunction with other programs such as SGI's Site Manager application. Our...
ASPLOS
2008
ACM
13 years 9 months ago
2008
ACM
Today's system programmers go to great lengths to extend the languages in which they program. For instance, system-specific compilers find errors in Linux and other systems, ...
ALENEX
2007
13 years 8 months ago
2007
We consider the problem of designing a distributed algorithm that, given an arbitrary connected graph G of nodes with unique labels, converts G into a sorted list of nodes. This a...