David Harel - researchr profile publications

researchr

You are not signed in
Sign in
Sign up

[Clear Filters]

Publications tagged traversal

A Vectorized Traversal Algorithm for Ray TracingJosé María Noguera, Carlos Ureña, Rubén Jesús García. grapp 2009: 58-63

Two dimensional dynamic stability for reconfigurable robots designed to traverse rough terrainBlake Beckman, Jeff K. Pieper, David Mackay, Michael Trentini, David Erickson. iros 2008: 2447-2452 [doi]

Planned and Traversable Play-Out: A Flexible Method for Executing Scenario-Based Programs:::, :::David Harel, Itai Segall. TACAS 2007: 485-499 [doi]

Simplifying web traversals by recognizing behavior patternsChristian Doerr, Daniel von Dincklage, Amer Diwan. ht 2007: 105-114 [doi]

Traversing the LMS terrainKelly Wainwright, Mike Osterman, Christina Finnerman, Bill Hill. siguccs 2007: 355-359 [doi]

Learning Informative Features for Indoor TraversabilityAlex Brooks, Alexei Makarenko, Ben Upcroft, Hugh F. Durrant-Whyte. iser 2008: 309-319 [doi]

DSM-PLW: Single-pass mining of path traversal patterns over streaming Web click-sequencesHua-Fu Li, Suh-Yin Lee, Man-Kwan Shan. cn, 50(10):1474-1487, 2006. [doi]

A formal model and efficient traversal algorithm for generating testbenches for verification of IEEE standard floating point divisionDavid W. Matula, Lee D. McFearin. date 2006: 1134-1138 [doi]

The distributed spanning tree: a scalable interconnection topology for efficient and equitable traversalSylvain Dahan, Jean-Marc Nicod, Laurent Philippe. ccgrid 2005: 243-250 [doi]

DSM-TKP: Mining Top-K Path Traversal Patterns over Web Click-StreamsHua-Fu Li, Suh-Yin Lee, Man-Kwan Shan. webist 2005: 326-329 [doi]

Distributed Spanning Tree Algorithms for Large Scale TraversalsSylvain Dahan. icpads 2005: 453-459 [doi]

Dataset Traversal with Motion-Controlled Transfer FunctionsCarlos D. Correa, Deborah Silver. visualization 2005: 46 [doi]

Evaluating Symbolic Traversal Algorithms Applied to Asynchronous Concurrent SystemsMarc Solé, Enric Pastor. acsd 2004: 207-216 [doi]

An Efficient Mining and Clustering Algorithm for Interactive Walk-Through Traversal PatternsShao-Shin Hung, Ting-Chia Kuo, Damon Shing-Min Liu. webist 2004: 356-362 [doi]

Paired Pointset TraversalPeter Hui, Marcus Schaefer. isaac 2004: 534-544 [doi]

Iterative Algorithm for Construction of a Tree from its Pre-order and Post-order Traversals in Linear Time and SpaceAdrian Deaconu. cuza, 14:69-80, 2004.

On mining webclick streams for path traversal patternsHua-Fu Li, Suh-Yin Lee, Man-Kwan Shan. WWW 2004: 404-405 [doi]

Invariant Checking Combining Forward and Backward TraversalChristian Stangier, Thomas Sidle. FMCAD 2004: 414-429 [doi]

On The Computation-Storage Trade-Offs of Hash Chain TraversalYaron Sella. fc 2003: 270-285 [doi]

Fractal Merkle Tree Representation and TraversalMarkus Jakobsson, Frank Thomson Leighton, Silvio Micali, Michael Szydlo. ctrsa 2003: 314-326 [doi]

Combining Simulation and Guided Traversal for the Verification of Concurrent SystemsEnric Pastor, Marco A. Peña. date 2003: 11158-11159 [doi]

Almost Optimal Hash Sequence TraversalDon Coppersmith, Markus Jakobsson. fc 2003: 102-119 [doi]

Controlling Buffer Usage in Critical Channel TraversingRob Simmonds, Cameron Kiddle, Kitty Wong, Brian Unger. anss 2002: 53-62 [doi]

Online Analytical Mining of Path Traversal Patterns for Web MeasurementJ. Fung, Hing Kwok Wong. JDM, 13(4):39-61, 2002.

Parallel Algorithms for the Degree-Constrained Minimum Spanning Tree Problem Using Nearest-Neighbor Chains and the Heap-Traversal TechniqueLi-Jen Mao, Sheau-Dong Lang. icppw 2002: 398-404 [doi]

Addressing blocking and scalability in critical channel traversingRob Simmonds, Cameron Kiddle, Brian Unger. pads 2002: 17-24 [doi]

Traversal Techniques for Concurrent SystemsMarc Solé, Enric Pastor. FMCAD 2002: 220-237 [doi]

Inorder traversal of splay treesColm Ó Dúnlaing. ENTCS, 74:134-157, 2002. [doi]

Efficient mining of traversal patternsYongqiao Xiao, Margaret H. Dunham. DKE, 39(2):191-214, 2001. [doi]

Universal Traversal Sequences with BacktrackingMichal Koucký. cocoon 2001: 21-27 [doi]

Dynamic Plane Shifting BSP TraversalStan Melax. graphicsinterface 2000: 213-220 [doi]

Obstacle Traversal for Space ExplorationZvi Shiller. icra 2000: 989-994

Traversing Itemset Lattice with Statistical Metric PruningShinichi Morishita, Jun Sese. PODS 2000: 226-236 [doi]

Data, Information, Knowledge: How Do We Attempt to Traverse across These Domains? (Abstract)Sasi Kumar Pillay. ssdbm 1999: 136 [doi]

Traversability Index: A New Concept for Planetary RoversHomayoun Seraji. icra 1999: 2006-2013

An Algorithm for an Eulerian Trail Traversing Specified Edges in Given orderMao-cheng Cai. DAM, 55(3):233-239, 1994. [doi]

Traversing the divide: documentation challenges of the 90sKarl L. Smart, Matthew E. Whitting, Freda Husic, Lisa Moore, Peter Orbeton. sigdoc 1994: 246-250 [doi]

An Efficient Crash-tolerant Sequential TraversalPaul Gastin, Vincent Villain. ppl, 3:87-97, 1993.

A Bounded-Space Tree Traversal AlgorithmDaniel S. Hirschberg, Steven S. Seiden. ipl, 47(4):215-219, 1993.

Uniform Traversal Combinators: Definition, Use and PropertiesLeonidas Fegaras, Tim Sheard, David W. Stemple. cade 1992: 148-162

Inversion of a Recursive Tree TraversalJan L. A. van de Snepscheut. ipl, 39(5):265-267, 1991.

Efficient traversal of well-behaved hierarchical trees of extents for ray-tracing complex scenesMark J. Charney, Isaac D. Scherson. vc, 6(3):167-178, 1990.

Construction of a Tree From its Traversals in Optimal Time and SpaceArne Andersson, Svante Carlsson. ipl, 34(1):21-25, 1990.

Two Algorithms for Constructing a Binary Tree from its TraversalsGen-Huey Chen, M. S. Yu, Lung-Tien Liu. ipl, 28(6):297-299, 1988.

The Expected Performance of Traversal Algorithms in Binary TreesKeith Brinck. cj, 28(4):426-432, 1985.

On the Time Overhead of Counters and Traversal MarkersIra R. Forman. ICSE 1981: 164-169

Traversing Binary Trees Simply and CheaplyJoseph M. Morris. ipl, 9(5):197-200, 1979.

Random Walks, Universal Traversal Sequences, and the Complexity of Maze ProblemsRomas Aleliunas, Richard M. Karp, Richard J. Lipton, László Lovász, Charles Rackoff. focs 1979: 218-223

Picture Segmentation by a Tree Traversal AlgorithmSteven L. Horowitz, Theodosios Pavlidis. JACM, 23(2):368-388, 1976. [doi]

An Improved Algorithm for Traversing Binary Trees Without Auxiliary StackJ. M. Robson. ipl, 2(1):12-14, 1973.

runs on WebDSL