Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
FSTTCS
2001
Springer
11 years 9 months ago
Semidefinite Programming Based Approximation Algorithms
Semidefinite programming based approximation algorithms, such as the Goemans and Williamson approximation algorithm for the MAX CUT problem, are usually shown to have certain perf...
Uri Zwick
FSTTCS
2001
Springer
11 years 9 months ago
Rewrite Closure for Ground and Cancellative AC Theories
Given a binary relation IE ∪ IR on the set of ground terms e signature, we define an abstract rewrite closure for IE ∪ IR. act rewrite closure can be interpreted as a speciali...
Ashish Tiwari
FSTTCS
2001
Springer
11 years 9 months ago
On Polynomial Representations of Boolean Functions Related to Some Number Theoretic Problems
We say a polynomial P over ZZM strongly M -represents a Boolean function F if F(x) ≡ P(x) (mod M) for all x ∈ {0, 1}n . Similarly, P one-sidedly M -represents F if F(x) = 0 ⇐...
Erion Plaku, Igor Shparlinski
FSTTCS
2001
Springer
11 years 9 months ago
Properties of Distributed Timed-Arc Petri Nets
Abstract. In [12] we started a research on a distributed-timed extension of Petri nets where time parameters are associated with tokens and arcs carry constraints that qualify the ...
Mogens Nielsen, Vladimiro Sassone, Jirí Srb...
FSTTCS
2001
Springer
11 years 9 months ago
The Directed Minimum-Degree Spanning Tree Problem
Consider a directed graph G = (V, E) with n vertices and a root vertex r ∈ V . The DMDST problem for G is one of constructing a spanning tree rooted at r, whose maximal degree is...
Radha Krishnan, Balaji Raghavachari
FSTTCS
2001
Springer
11 years 9 months ago
On Clustering Using Random Walks
Abstract. We propose a novel approach to clustering, based on deterministic analysis of random walks on the weighted graph associated with the clustering problem. The method is cen...
David Harel, Yehuda Koren
FSTTCS
2001
Springer
11 years 9 months ago
Beyond Regular Model Checking
Abstract. Regular Model-Checking (RMC) is a technique for the formal verification of infinite state systems based on the theory of regular languages. In the paper “Beyond Regul...
Dana Fisman, Amir Pnueli
FSTTCS
2001
Springer
11 years 9 months ago
Computability and Complexity Results for a Spatial Assertion Language for Data Structures
Abstract. This paper studies a recently developed an approach to reasoning about mutable data structures, which uses an assertion language with spatial conjunction and implication ...
Cristiano Calcagno, Hongseok Yang, Peter W. O'Hear...
FSTTCS
2001
Springer
11 years 9 months ago
When Worlds Collide: Derandomization, Lower Bounds, and Kolmogorov Complexity
This paper has the following goals: – To survey some of the recent developments in the field of derandomization. – To introduce a new notion of time-bounded Kolmogorov complex...
Eric Allender
books