Bas Luttik - 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

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

Secure Networking with NAT Traversal for Enhanced MobilityLubomir Cvrk, Vít Vrba. ifip6-8 2007: 355-366 [doi]

NAT Traversal: Problems and SolutionsEddy Nini. hpcncs 2007: 41-46

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]

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]

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]

Asking the Right Questions: Task Hierarchy Predictive Traversal Mechanisms for Mixed Initiative Dialog ManagementJuan M. Huerta. nlucs 2004: 106-115

Merkle Tree Traversal in Log Space and TimeMichael Szydlo. eurocrypt 2004: 541-554 [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]

Log-space constructible universal traversal sequences for cycles of length O(n:::4.03:::)Michal Koucký. TCS, 296(1):117-144, 2003. [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]

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

Universal traversal sequences with backtrackingMichal Koucký. jcss, 65(4):717-726, 2002. [doi]

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

Log-Space Constructible Universal Traversal Sequences for Cycles of Length O(n:::4.03:::)Michal Koucký. cocoon 2001: 11-20 [doi]

Log-space Constructible Universal Traversal Sequences for Cycles of Length O(n:::4.03:::)Michal Koucký. eccc, 8(13), 2001. [doi]

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

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

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

Specification of Rewriting StrategiesBas Luttik, Eelco Visser. ASF+SDF 1997:

An Optimal Ray Traversal Scheme for Visualizing Colossal Medical VolumesAsish Law, Roni Yagel. vbc 1996: 43-52

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]

Fast Surface Rendering from Raster Data by Voxel Traversal Using Chessboard DistanceMilos Srámek. visualization 1994: 188-195

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

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

Face Traverses and a Volume Algorithm for PolyhedraJ. Schaer, M. G. Stone. BIRTHDAY 1991: 290-297

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

Topologically Traversing the RETE networkMark Perlin. aai, 4(3):155-177, 1990.

Polynomial Universal Traversing Sequences for Cycles Are Constructible (Extended Abstract)Sorin Istrail. stoc 1988: 491-503

Minimum Cost Path Planning for Autonomous Robot in the Random Traversability SpaceP. Graglia, Alex Meystel. ieaaie 1988: 1089-1096 [doi]

Universal Traversal Sequences for Paths and CyclesMichael F. Bridgland. jal, 8(3):395-404, 1987.

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.

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

Nonrecursive Traversals of TreesWalter A. Burkhard. cj, 18(3):227-230, 1975.

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

Fast and Read-Only Algorithms for Traversing Trees Without an Auxiliary StackLaurent Siklóssy. ipl, 1(4):149-152, 1972.

runs on WebDSL