BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Used together with:
mark (15)
garbag (9)
collect (8)
line (6)
method (4)

Stem sweep$ (all stems)

36 papers:

LCTESLCTES-2014-KimBL #concurrent #garbage collection #javascript #lightweight
Lightweight and block-level concurrent sweeping for javascript garbage collection (HK, SB, JL), pp. 155–164.
Planning by Prioritized Sweeping with Small Backups (HvS, RSS), pp. 361–369.
ISMMISMM-2013-MorikawaUI #adaptation #garbage collection #lisp
Adaptive scanning reduces sweep time for the Lisp2 mark-compact garbage collector (KM, TU, HI), pp. 15–26.
DACDAC-2012-WelpKK #optimisation
Generalized SAT-sweeping for post-mapping optimization (TW, SK, AK), pp. 814–819.
ISMMISMM-2011-VeldemaP #gpu
Iterative data-parallel mark&sweep on a GPU (RV, MP), pp. 1–10.
DLTDLT-2008-KapoutsisKM #automaton #complexity #on the
On the Size Complexity of Rotating and Sweeping Automata (CAK, RK, TM), pp. 455–466.
ISMMISMM-2007-GarnerBF #effectiveness #garbage collection
Effective prefetch for mark-sweep garbage collection (RG, SMB, DF), pp. 43–54.
ISMMISMM-2007-StanchinaM #algorithm #implementation #realtime
Mark-sweep or copying?: a “best of both worlds” algorithm and a hardware-supported real-time implementation (SS, MM), pp. 173–182.
DACDAC-2006-ZhuKKS #satisfiability
SAT sweeping with local observability don’t-cares (QZ, NK, AK, ALSV), pp. 229–234.
Small Sweeping 2NFAs Are Not Closed Under Complement (CAK), pp. 144–156.
TACASTACAS-2004-MailundW #graph #reachability #using
Obtaining Memory-Efficient Reachability Graph Representations Using the Sweep-Line Method (TM, MW), pp. 177–191.
TACASTACAS-2004-Schmidt #automation #generative
Automated Generation of a Progress Measure for the Sweep-Line Method (KS0), pp. 192–204.
Coplanar Light Sweep-Surface Supported Uncalibrated Photometric Stereo (HK, EKT, JGW, RV), pp. 92–95.
ASPLOSASPLOS-2004-CherHV #analysis #garbage collection #hardware
Software prefetching for mark-sweep garbage collection: hardware analysis and software redesign (CYC, ALH, TNV), pp. 199–210.
ISMMISMM-2004-OssiaBS #concurrent #garbage collection
Mostly concurrent compaction for mark-sweep GC (YO, OBY, MS), pp. 25–36.
OOPSLAOOPSLA-2003-AzatchiLPP #garbage collection #on the fly
An on-the-fly mark and sweep garbage collector based on sliding views (HA, YL, HP, EP), pp. 269–281.
Cache Oblivious Distribution Sweeping (GSB, RF), pp. 426–438.
FMFME-2002-KristensenM #safety
A Generalised Sweep-Line Method for Safety Properties (LMK, TM), pp. 549–567.
A Sweep-Line Method for State Space Exploration (SC, LMK, TM), pp. 450–464.
Structured Prioritised Sweeping (RD), pp. 82–89.
Reducing Sweep Time for a Nearly Empty Heap (YCC, SMM, KE, DS), pp. 378–389.
VLDBVLDB-1998-ArgePRSV #scalability
Scalable Sweeping-Based Spatial Join (LA, OP, SR, TS, JSV), pp. 570–581.
ISMMISMM-1998-ColnetCZ #algorithm #compilation
Compiler Support to Customize the Mark and Sweep Algorithm (DC, PC, OZ), pp. 154–165.
ISMMISMM-1998-HuelsbergenW #concurrent #garbage collection
Very Concurrent Mark-&-Sweep Garbage Collection without Fine-Grain Synchronization (LH, PW), pp. 166–175.
Comparing Mostly-Copying and Mark-Sweep Conservative Collection (FS, JGM), pp. 68–78.
ICDARICDAR-1997-ChangLP #algorithm #analysis
Line sweep thinning algorithm for feature analysis (FC, YCL, TP), pp. 123–127.
ICDARICDAR-v1-1995-ChangCPS #algorithm
A line sweep thinning algorithm (FC, YPC, TP, TYS), pp. 227–230.
ISMMIWMM-1995-ArmstrongV #garbage collection #realtime
One Pass Real-Time Generational Mark-Sweep Garbage Collection (JLA, RV), pp. 313–322.
ISMMIWMM-1995-MaedaKITHN #garbage collection #on the fly
On-the-fly Global Garbage Collection Based on Partly Mark-Sweep (MM, HK, YI, TT, AH, JN), pp. 283–296.
ISMMIWMM-1995-Piquer #distributed #garbage collection
Indirect Mark and Sweep: A Distributed GC (JMP), pp. 267–282.
POPLPOPL-1992-Edelson #c++
A Mark-and-Sweep Collector for C++ (DRE), pp. 51–58.
LISPLFP-1990-Zorn #garbage collection
Comparing Mark-and-Sweep and Stop-and-Copy Garbage Collection (BGZ), pp. 87–98.
Topologically Sweeping an Arrangement (HE, LJG), pp. 389–403.
Passes, Sweeps and Visits (JE, GF), pp. 193–207.
ICALPICALP-1980-Berman #automaton
A Note on Sweeping Automata (PB), pp. 91–97.
STOCSTOC-1979-Sipser #automaton #bound
Lower Bounds on the Size of Sweeping Automata (MS), pp. 360–364.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.