68 search results - page 6 / 14 » Open Graphs and Monoidal Theories |
POPL
2009
ACM
14 years 8 months ago
2009
ACM
Deadlock in multithreaded programs is an increasingly important problem as ubiquitous multicore architectures force parallelization upon an ever wider range of software. This pape...
EC
1998
13 years 7 months ago
1998
L. M. Adleman launched the field of DNA computing with a demonstration in 1994 that strands of DNA could be used to solve the Hamiltonian path problem for a simple graph. He also...
WWW
2005
ACM
14 years 8 months ago
2005
ACM
Being able to determine the provenience of statements is a fundamental step in any SW trust modeling. We propose a methodology that allows signing of small groups of RDF statement...
ICAIL
2009
ACM
14 years 6 days ago
2009
ACM
We propose an analysis of the codified Law of France as a structured system. Fifty two legal codes are selected on the basis of explicit legal criteria and considered as vertices ...
JCT
2007
13 years 7 months ago
2007
Abstract. We develop linear representation theory for bicircular matroids, a chief example being a matroid associated with forests of a graph, and bicircular lift matroids, a chief...