## Stem breadth$ (all stems)

### 25 papers:

- SANER-2015-SilvaCMS #analysis #fine-grained
- Niche vs. breadth: Calculating expertise over time through a fine-grained analysis (JRdSJ, EC, LM, AS), pp. 409–418.
- DLT-2014-MarsaultS
- Breadth-First Serialisation of Trees and Rational Languages — (Short Paper) (VM, JS), pp. 252–259.
- ICALP-v2-2013-HenzingerKN #maintenance #network
- Sublinear-Time Maintenance of Breadth-First Spanning Tree in Partially Dynamic Networks (MH, SK, DN), pp. 607–619.
- ITiCSE-2012-Rosenbloom #animation
- Breadth first search (animation and obstacle avoidance) (AR), p. 375.
- FM-2012-NedunuriSC #algorithm #performance
- Theory and Techniques for Synthesizing Efficient Breadth-First Search Algorithms (SN, DRS, WRC), pp. 308–325.
- PPoPP-2012-LiuAHLSZWT #gpu #implementation #named
- FlexBFS: a parallelism-aware implementation of breadth-first search on GPU (GL, HA, WH, XL, TS, WZ, XW, XT), pp. 279–280.
- ICDAR-2011-GhorbelMLA #interactive #sketching
- Interactive Competitive Breadth-First Exploration for Sketch Interpretation (AG, SM, AL, ÉA), pp. 1195–1199.
- DAC-2010-LuoWH #effectiveness #gpu #implementation
- An effective GPU implementation of breadth-first search (LL, MDFW, WmWH), pp. 52–55.
- ECIR-2009-FetterlyCV #effectiveness
- Measuring the Search Effectiveness of a Breadth-First Crawl (DF, NC, VV), pp. 388–399.
- SIGIR-2008-FetterlyCV #effectiveness
- Search effectiveness with a breadth-first crawl (DF, NC, VV), pp. 755–756.
- ITiCSE-2007-DoddsAKL
- Breadth-first CS 1 for scientists (ZD, CA, GK, RLH), pp. 23–27.
- ITiCSE-2006-RauchasSK #education #experience #programming
- The effect of prior programming experience in a scheme-based breadth-first curriculum at wits (SR, IDS, BK), p. 326.
- CHI-2006-ZhaoAH #multi #using
- Zone and polygon menus: using relative position to increase the breadth of multi-stroke marking menus (SZ, MA, KH), pp. 1077–1086.
- ITiCSE-2005-Verma #automaton #interactive #visual notation
- A visual and interactive automata theory course emphasizing breadth of automata (RMV), pp. 325–329.
- STOC-2004-Wigderson #question #why
- Depth through breadth, or why should we attend talks in other areas? (AW), p. 579.
- KR-2004-ZhouH #heuristic
- Breadth-First Heuristic Search (RZ, EAH), pp. 701–709.
- ASE-2003-BarnatBC #ltl #model checking #parallel
- Parallel Breadth-First Search LTL Model-Checking (JB, LB, JC), pp. 106–115.
- ITiCSE-2001-Murtagh
- Teacing breadth-first depth-first (TPM), pp. 37–40.
- ICFP-2000-Okasaki #algorithm #design #lessons learnt
- Breadth-first numbering: lessons from a small exercise in algorithm design (CO), pp. 131–136.
- CADE-1999-Bishop
- A Breadth-First Strategy for Mating Search (MB), pp. 359–373.
- VLDB-1997-HuangJR #optimisation #traversal #using
- Spatial Joins Using R-trees: Breadth-First Traversal with Global Optimizations (YWH, NJ, EAR), pp. 396–405.
- KDD-1997-AronisP #algorithm #data mining #mining #performance
- Increasing the Efficiency of Data Mining Algorithms with Breadth-First Marker Propagation (JMA, FJP), pp. 119–122.
- PPoPP-1997-YangO #parallel
- Parallel Breadth-First BDD Construction (BY, DRO), pp. 145–156.
- SEKE-1995-Lee #execution #logic programming #parallel #source code
- Parallel Execution of Logic Programs with Breadth-first Search (WSL), pp. 470–477.
- DAC-1991-OchiIY
- Breadth-First Manipulation of SBDD of Boolean Functions for Vector Processing (HO, NI, SY), pp. 413–416.