Alin Deutsch. Personal communication, January 24, 2001. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Fast Index for Semistructured Data - Cooper, Sample, Franklin.. (2001) (46 citations) (Correct)
....to create storage mapped tables (SM tables) Most of the data can be mapped into tuples and stored in the SM tables, while more irregularly structured data must be stored in overflow buckets, similar to the edge mapping. The schema for the SM tables was obtained from the STORED investigators [13]. The SM tables identified for the DBLP data are inproceedings, for conference papers, and articles, for journal papers. Conference and journal paper information that does not fit into the SM tables is stored in overflow buckets along with other types of publications (such as books. To evaluate ....
Alin Deutsch. Personal communication, January 24, 2001.
Counting Lattice Paths By Narayana Polynomials - Sulanke (2000) (2 citations) (Correct)
....(0; 2) 1; 0)g. Proposition 4. jL 4 (n)j = N n (4) 2: We remark that, if L 0 4 (n) denotes the set of those paths in L 4 (n) that begin with unit vertical step, then clearly, for n 0, jL 0 4 (n)j = jL 4 (n)j=2. We nd that (jL 0 4 (n)j) n 0 = 1; 1; 5; 29; 185; 1257; 8925; Deutsch s [2] interest in counting L 0 4 (n) motivated this section. Proof. Replicate each path in L 2 (n) by independently labeling the intermediate vertices of its noninitial double ascents with one of the markings pp , pa , ap , or aa and labeling the initial double ascent with either p or a . ....
E. Deutsch, personal communication, 1999
Counting Lattice Paths With Various Step Sets - Sulanke (Correct)
....pair, with the step D and by removing the color from each red peak. Figures 1e and 1f give an example of the map g with A = f1,5g ignored. 3. Arbitrary vertical and horizontal steps Here we consider vertical and horizontal steps of varying lengths. Take S 4 = P f0g) f0g P) Deutsch s [2] interest in counting L 4 (n) motivated this section. Proposition 4. jL 4 (n)j = N n (4) 2: Proof. Replicate each path in L 2 (n) by independently labeling the intermediate vertices of its noninitial double ascents with one of the markings pp , pa , ap , or aa and labeling the initial ....
E. Deutsch, personal communication, 1999
An Efficient Implementation of Self, a Dynamically-Typed.. - Chambers, Ungar, Lee (1991) (27 citations) (Correct)
....V2.4 b2 Smalltalk 80 virtual machine, rated at about 4 Dorados 7 [22] this system includes the DeutschSchiffman techniques described earlier. We compare transliterations from C into Smalltalk and SELF of the Stanford integer benchmarks [13] and the Richards operating system simulation benchmark [10], as well as the following small benchmarks, adapted from Smalltalk 80 systems [18] sumToTest = 1 sumTo: 10000 ) sumTo: arg = total 0 to: arg Do: index total: total index. total ) recurseTest = 14 recurse ) recurse = 0 ifFalse: 1) recurse. 1) recurse. ....
Deutsch, L. P. Richards benchmark. Personal communication (1988).
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC