A Work-Optimal Algorithm on log delta n Processors for a P-Complete Problem

We present a parallel algorithm for the Lexicographically First Maximal Independent Set Problem on graphs with bounded degree 3 that is work-optimal on a shared memory machine with up to $\log ^\delta n$ processors, for any $0 < \delta < 1$. Since this problem is P-complete it follows (assuming \mathcalNC \not \mathcalP) that the algorithmics of coarse grained parallel machines and of fine grained parallel machines differ substantially

Java Programs do not have Bounded Treewidth

We show that the control-flow graphs of Java programs, due to the labelled break and continue statements, have no upper bound on their treewidth. A single Java method containing $k$ labels and a loop nesting depth of $k+1$ can give a control-flow-graph with treewidth $2k+1$

LHRH sparing therapy in patients with chemotherapy-naïve, mCRPC treated with abiraterone acetate plus prednisone: results of the randomized phase II SPARE trial

Background Although the benefit of androgen deprivation therapy (ADT) continuation in metastatic castration-resistant prostate cancer (mCRPC) remains controversial, clinical evidence is lacking. Recent results indicated that treatment with abiraterone acetate (AA) plus prednisone (P) further suppresses serum testosterone levels over ADT alone, suggesting that continuation of ADT in the treatment of mCRPC may not be necessary. Methods In this exploratory phase 2 study, mCRPC patients were randomized with a 1:1 ratio to receive either continued ADT plus AA + P (Arm A) or AA + P alone (Arm B). The primary endpoint was the rate of radiographic progression-free survival (rPFS) at month 12. Secondary endpoints included PSA-response rate, objective response, time to PSA progression and safety. Results A total of 68 patients were equally randomized between the two study arms. Median testosterone-levels remained below castrate-levels throughout treatment in all patients. According to the intention-to-treat analysis the rPFS rate was 0.84 in Arm A and 0.89 in Arm B. Moderate and severe treatment-emergent adverse events were reported for 72% of the patients in Arm A and for 85% of the patients in Arm B. Conclusions AA + P treatment without ADT may be effective in mCRPC patients and ADT may not be necessary in patients receiving AA + P

A work-optimal coarse-grained PRAM algorithm for Lexicographically First Maximal Independent Set

Colloque avec actes et comité de lecture. internationale.International audienceThe ``Lexicographically First Maximal Independent Set Problem'' on graphs with bounded degree 3 is at most sqrt(n)-complete, and thus very likely not parallelizable in a fine-grained setting. On the other hand, we show that in a coarse-grained setting (few processors and a lot of data) the situation is different, by giving a work-optimal algorithm on a shared memory machine for n and p such that p log p \in O(\log n)

Java Programs do not have bounded treewidth

We show that the control flow graphs of Java programs, due to the labelled break and continue statements, have no upper bound on their treewidth. A single Java method containing k labels and a loop nesting depth of k+1 can give a control-flow-graph with treewidth 2k+1