Search Sciweavers | Sciweavers

20

click to vote

JCSS
2006

47views more JCSS 2006»

Maximizing data locality in distributed systems

13 years 9 months ago

Download www.math.ucsd.edu

Fan R. K. Chung, Ronald L. Graham, Ranjita Bhagwan...

claim paper

Read More »

25

click to vote

JCSS
1998

65views more JCSS 1998»

Good Degree Bounds on Nullstellensatz Refutations of the Induction Principle

13 years 9 months ago

Download math.ucsd.edu

This paper gives nearly optimal, logarithmic upper and lower bounds on the minimum degree of Nullstellensatz refutations (i.e., polynomials) of the propositional induction princip...

Samuel R. Buss, Toniann Pitassi

claim paper

Read More »

24

click to vote

JCSS
2010

60views more JCSS 2010»

Scaling up workflow-based applications

13 years 8 months ago

Download pegasus.isi.edu

Scott Callaghan, Ewa Deelman, Dan Gunter, Gideon J...

claim paper

Read More »

26

click to vote

JCSS
2000

98views more JCSS 2000»

Rooted Branching Bisimulation as a Congruence

13 years 9 months ago

Download www.cs.vu.nl

This article presents a congruence format, in structural operational semantics, for rooted branching bisimulation equivalence. The format imposes additional requirements on Groote...

Wan Fokkink

claim paper

Read More »

26

click to vote

JCSS
2010

68views more JCSS 2010»

Simplified proof of the blocking theorem for free-choice Petri nets

13 years 8 months ago

Download www.pst.informatik.uni-muenchen.de

: Every cluster in a bounded and live free-choice system has a unique blocking marking. It can be reached by firing an occurrence sequence, which avoids any transition of the clust...

Joachim Wehler

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers