Stem almost$ (all stems)

76 papers:

PODS-2015-CzerwinskiMPP

The (Almost) Complete Guide to Tree Pattern Containment (WC, WM, PP, MP), pp. 117–130.

STOC-2015-ChenDST #adaptation #query #testing

Boolean Function Monotonicity Testing Requires (Almost) n 1/2 Non-adaptive Queries (XC, AD, RAS, LYT), pp. 519–528.

STOC-2015-KothariM #generative #pseudo

Almost Optimal Pseudorandom Generators for Spherical Caps: Extended Abstract (PKK, RM), pp. 247–256.

MoDELS-J-2011-Steimann15 #refactoring

From well-formedness to meaning preservation: model refactoring for almost free (FS), pp. 307–320.

MoDELS-J-2011-Steimann15 #refactoring

From well-formedness to meaning preservation: model refactoring for almost free (FS), pp. 307–320.

GPCE-2015-ScherrC #domain-specific language #embedded #staged

Almost first-class language embedding: taming staged embedded DSLs (MS, SC), pp. 21–30.

ASPLOS-2015-NguyenWBFHX #big data #bound #compilation #named #runtime

FACADE: A Compiler and Runtime for (Almost) Object-Bounded Big Data Applications (KN, KW, YB, LF, JH, G(X), pp. 675–690.

CAV-2015-DesaiSQBE #abstraction #approximate #distributed

Approximate Synchrony: An Abstraction for Distributed Almost-Synchronous Systems (AD, SAS, SQ, DB, JCE), pp. 429–448.

LICS-2015-ClementeR #multi #problem #worst-case

Multidimensional beyond Worst-Case and Almost-Sure Problems for Mean-Payoff Objectives (LC, JFR), pp. 257–268.

STOC-2014-HaitnerT #protocol

An almost-optimally fair three-party coin-flipping protocol (IH, ET), pp. 408–416.

ICALP-v1-2014-Ben-SassonRTW #algorithm #proving

Sampling-Based Proofs of Almost-Periodicity Results and Algorithmic Applications (EBS, NRZ, MT, JW), pp. 955–966.

KDD-2014-Yoshida #adaptation #algorithm #linear #sketching #using

Almost linear-time algorithms for adaptive betweenness centrality using hypergraph sketches (YY), pp. 1416–1425.

OOPSLA-2014-Desai0M #proving #reduction #source code #using

Natural proofs for asynchronous programs using almost-synchronous reductions (AD, PG, PM), pp. 709–725.

POPL-2014-CoughlinC #analysis #composition #invariant

Fissile type analysis: modular checking of almost everywhere invariants (DC, BYEC), pp. 73–86.

PLDI-2013-BlackshearL #composition #framework #semantics #specification

Almost-correct specifications: a modular semantic framework for assigning confidence to warnings (SB, SKL), pp. 209–218.

STOC-2013-FeldmanFGL #performance

Simultaneous auctions are (almost) efficient (MF, HF, NG, BL), pp. 201–210.

DLT-J-2012-HolzerJ13 #automaton #equivalence #fault

From Equivalence to Almost-Equivalence, and beyond: Minimizing Automata with Errors (MH, SJ), pp. 1083–1098.

CSCW-2013-YaroshTMA #communication #quote #using

“Almost touching”: parent-child remote communication using the sharetable system (SY, AT, SM, GDA), pp. 181–192.

ICML-c3-2013-KarninKS #multi

Almost Optimal Exploration in Multi-Armed Bandits (ZSK, TK, OS), pp. 1238–1246.

DATE-2012-YangLTW #modelling

Almost every wire is removable: A modeling and solution for removing any circuit wire (XY, TKL, WCT, YLW), pp. 1573–1578.

FoSSaCS-2012-JagadeesanPR #exclamation

Brookes Is Relaxed, Almost! (RJ, GP, JR), pp. 180–194.

DLT-J-2011-PelantovaS12 #image #word

Almost Rich Words as Morphic Images of Rich Words (EP, SS), pp. 1067–1084.

DLT-2012-HolzerJ #automaton #equivalence #fault

From Equivalence to Almost-Equivalence, and Beyond — Minimizing Automata with Errors — (Extended Abstract) (MH, SJ), pp. 190–201.

ICALP-v1-2012-AmbainisBBKOSV #game studies #quantum

Quantum Strategies Are Better Than Classical in Almost Any XOR Game (AA, AB, KB, DK, RO, JS, MV), pp. 25–37.

ECIR-2012-NeumayerBN12a #effectiveness #semantics

When Simple is (more than) Good Enough: Effective Semantic Search with (almost) no Semantics (RN, KB, KN), pp. 540–543.

SAC-2012-DiasDHS #sorting #symmetry #using

Sorting genomes using almost-symmetric inversions (ZD, UD, LSH, JCS), pp. 1368–1374.

STOC-2011-AdamaszekCER #bound #order

Almost tight bounds for reordering buffer management (AA, AC, ME, HR), pp. 607–616.

STOC-2011-ChienHSS #commutative

Almost settling the hardness of noncommutative determinant (SC, PH, AS, SS), pp. 499–508.

DLT-2011-PelantovaS #infinity #word

Infinite Words Rich and Almost Rich in Generalized Palindromes (EP, SS), pp. 406–416.

ICALP-v1-2011-ElsasserT #complexity

Settling the Complexity of Local Max-Cut (Almost) Completely (RE, TT), pp. 171–182.

SAT-2011-OrdyniakPS #satisfiability

Satisfiability of Acyclic and almost Acyclic CNF Formulas (II) (SO, DP, SS), pp. 47–60.

STOC-2010-ChierichettiLP #bound

Almost tight bounds for rumour spreading with conductance (FC, SL, AP), pp. 399–408.

SAT-2010-MatthewsP #satisfiability

Uniquely Satisfiable k-SAT Instances with Almost Minimal Occurrences of Each Variable (WM, RP), pp. 369–374.

SAC-2009-Djelloul #exponential #finite #infinity #linear

From exponential to almost linear decomposability of finite or infinite trees (KD), pp. 897–902.

ICSE-2009-RaysideBSNMJ #abstraction #generative #implementation #similarity

Equality and hashing for (almost) free: Generating implementations from abstraction functions (DR, ZB, RS, JPN, AM, DJ), pp. 342–352.

STOC-2008-Ben-AroyaT #combinator #graph #using

A combinatorial construction of almost-ramanujan graphs using the zig-zag product (ABA, ATS), pp. 325–334.

ICALP-A-2008-HallgrenH #quantum

Superpolynomial Speedups Based on Almost Any Quantum Circuit (SH, AWH), pp. 782–795.

ICALP-A-2008-RazgonO #parametricity #satisfiability

Almost 2-SAT Is Fixed-Parameter Tractable (Extended Abstract) (IR, BO), pp. 551–562.

LICS-2008-BaierBBBG #automaton #infinity #model checking

Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata (CB, NB, PB, TB, MG), pp. 217–226.

STOC-2007-AlonAKMRX #independence #testing

Testing k-wise and almost k-wise independence (NA, AA, TK, KM, RR, NX), pp. 496–505.

STOC-2007-HavivR #polynomial #problem

Tensor-based hardness of the shortest vector problem to within almost polynomial factors (IH, OR), pp. 469–477.

DLT-2007-Pritykin #on the #sequence

On Almost Periodicity Criteria for Morphic Sequences in Some Particular Cases (YP), pp. 361–370.

PPDP-2007-Gnaedig #induction #termination

Induction for positive almost sure termination (IG), pp. 167–178.

STOC-2006-MoshkovitzR #fault

Sub-constant error low degree test of almost-linear size (DM, RR), pp. 21–30.

ICFP-2006-BringertR #composition

A pattern for almost compositional functions (BB, AR), pp. 216–226.

RTA-2006-BournezG #proving #termination

Proving Positive Almost Sure Termination Under Strategies (OB, FG), pp. 357–371.

ICALP-2005-Hast #approximate #linear #named #random

Approximating — Outperforming a Random Assignment with Almost a Linear Factor (GH), pp. 956–968.

ICALP-2005-PersianoV #concurrent #constant

Single-Prover Concurrent Zero Knowledge in Almost Constant Rounds (GP, IV), pp. 228–240.

RTA-2005-BournezG #proving #termination

Proving Positive Almost-Sure Termination (OB, FG), pp. 323–337.

ITiCSE-2004-MullerHA #problem

(An almost) pedagogical pattern for pattern-based problem-solving instruction (OM, BH, HA), pp. 102–106.

STOC-2004-ChenKLRSV #bound #confluence #theorem

(Almost) tight bounds and existence theorems for confluent flows (JC, RDK, LL, RR, RS, AV), pp. 529–538.

STOC-2004-RodittyZ #algorithm #graph #linear #reachability

A fully dynamic reachability algorithm for directed graphs with an almost linear update time (LR, UZ), pp. 184–191.

ICALP-2004-LebharS #distributed #network

Almost Optimal Decentralized Routing in Long-Range Contact Networks (EL, NS), pp. 894–905.

VLDB-2003-HulgeriS #cost analysis #named #optimisation #parametricity #query

AniPQO: Almost Non-intrusive Parametric Query Optimization for Nonlinear Cost Functions (AH, SS), pp. 766–777.

STOC-2003-DietzfelbingerW #graph #random

Almost random graphs with simple hash functions (MD, PW), pp. 629–638.

VLDB-2002-BlottK #database #execution #in memory #protocol #transaction

An Almost-Serial Protocol for Transaction Execution in Main-Memory Database Systems (SB, HFK), pp. 706–717.

STOC-2002-AchlioptasM #graph

Almost all graphs with average degree 4 are 3-colorable (DA, CM), pp. 199–208.

VLDB-2001-GravanoIJKMS #approximate #database #for free #string

Approximate String Joins in a Database (Almost) for Free (LG, PGI, HVJ, NK, SM, DS), pp. 491–500.

STOC-2001-Vocking #permutation

Almost optimal permutation routing on hypercubes (BV), pp. 530–539.

PODS-2000-AtallahP #data access #parallel #query

(Almost) Optimal Parallel Block Access for Range Queries (MJA, SP), pp. 205–215.

ICPR-v2-2000-Duin #classification

Classifiers in Almost Empty Spaces (RPWD), pp. 2001–2007.

STOC-1998-Ta-Shma

Almost Optimal Dispersers (ATS), pp. 196–202.

STOC-1998-Zwick

Finding Almost-Satisfying Assignments (UZ), pp. 551–560.

SIGIR-1997-SilversteinP #clustering #corpus #set

Almost-Constant-Time Clustering of Arbitrary Corpus Subsets (CS, JOP), pp. 60–66.

STOC-1996-AwerbuchAFL #how #nondeterminism

Making Commitments in the Face of Uncertainty: How to Pick a Winner Almost Every Time (Extended Abstract) (BA, YA, AF, FTL), pp. 519–530.

POPL-1996-Steensgaard #analysis #linear #points-to

Points-to Analysis in Almost Linear Time (BS), pp. 32–41.

ICALP-1991-GalilM #algorithm #linear #problem

An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem (ZG, OM), pp. 719–727.

STOC-1988-GabowT #algorithm #problem

Almost-Optimum Speed-ups of Algorithms for Bipartite Matching and Related Problems (HNG, RET), pp. 514–527.

STOC-1986-GoldwasserK

Almost All Primes Can Be Quickly Certified (SG, JK), pp. 316–329.

STOC-1986-Hastad #bound

Almost Optimal Lower Bounds for Small Depth Circuits (JH), pp. 6–20.

FPCA-1985-Debray85 #optimisation #prolog #recursion #source code

Optimizing Almost-Tail-Recursive Prolog Programs (SKD), pp. 204–219.

STOC-1981-HongR #graph

Graphs that Are Almost Binary Trees (Preliminary Version) (JWH, ALR), pp. 334–341.

ICALP-1980-Galil #algorithm #database #dependence #linear #relational

An Almost Linear Time Algorithm for Computing a Dependency Basis in a Relational Data Base (ZG), pp. 246–256.

POPL-1978-Culik #parallel

Almost Control-Free (Indeterministic) Parallel Computation on Permit Schemes (KC), pp. 176–184.

POPL-1978-Reif #analysis #linear #programming

Symbolic Programming Analysis in Almost Linear Time (JHR), pp. 76–83.

ICALP-1974-Mehlhorn #decidability #recursion

The “Almost All” Theory of Subrecursive Degrees is Decidable (KM), pp. 317–325.