BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Used together with:
rout (7)
router (5)
graph (3)
buffer (2)
correct (2)

Stem maze$ (all stems)

17 papers:

SIGMODSIGMOD-2014-SatishSPSPHSYD #dataset #framework #graph #navigation #using
Navigating the maze of graph analytics frameworks using massive graph datasets (NS, NS, MMAP, JS, JP, MAH, SS, ZY, PD), pp. 979–990.
HCIHIMI-AS-2014-YamaguchiTT #learning #process #visualisation
Visualizing Mental Learning Processes with Invisible Mazes for Continuous Learning (TY, KT, KT), pp. 137–148.
OnwardOnward-2012-McDirmid
Escaping the maze of twisty classes (SM), pp. 127–138.
DACDAC-2010-LiuKLC #bound #concurrent #multi #thread
Multi-threaded collision-aware global routing with bounded-length maze routing (WHL, WCK, YLL, KYC), pp. 200–205.
ITiCSEITiCSE-2006-Snapp06a #algorithm #education #graph
Teaching graph algorithms in a corn maze (RRS), p. 347.
DACDAC-2004-HuangW #proximity
Optical proximity correction (OPC): friendly maze routing (LDH, MDFW), pp. 186–191.
ICPRICPR-v3-2004-GrossK #mobile #probability #robust #scalability #self
Robust Omniview-based Probabilistic Self-Localization for Mobile Robots in Large Maze-like Environments (HMG, AK), pp. 266–269.
DATEDATE-2002-HuangLWG #constraints
Maze Routing with Buffer Insertion under Transition Time Constraints (LDH, ML, DFW, YG), pp. 702–707.
DACDAC-2000-LaiW
Maze routing with buffer insertion and wiresizing (ML, DFW), pp. 374–378.
DATEEDAC-1994-HuijbregtsEJ #design #on the
On Design Rule Correct Maze Routing (EPH, JTJvE, JAGJ), pp. 407–411.
DACDAC-1992-Palczewski #parallel
Plane Parallel a Maze Router and Its Application to FPGAs (MP), pp. 691–697.
DACDAC-1988-ArnoldS #interactive
An Interactive Maze Router with Hints (MHA, WSS), pp. 672–676.
DACDAC-1987-WonSE #hardware
A Hardware Accelerator for Maze Routing (YW, SS, YMEZ), pp. 800–806.
DACDAC-1982-Korn #performance
An efficient variable-cost maze router (RKK), pp. 425–431.
DACDAC-1980-TadaYKS #performance #strict
A fast maze router with iterative use of variable search space restriction (FT, KY, TK, TS), pp. 250–254.
DACDAC-1978-Soukup #performance
Fast maze router (JS), pp. 100–102.
STOCSTOC-1972-Savitch #automaton
Maze Recognizing Automata (Extended Abstract) (WJS), pp. 151–156.

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.