298:
339:
142:
358:
217:
198:
97:
233:
182:
186:
363:
332:
74:
40:
125:"Loopless algorithms for generating permutations, combinations, and other combinatorial configuration"
325:
270:
66:. The objects must be immediately available in simple form without requiring any additional steps.
190:
129:
47:
274:
194:
156:
237:
146:
309:
266:
352:
305:
138:
59:
28:
297:
256:
174:
100:
63:
55:
51:
225:
90:
160:
278:
224:. International Conference on Mathematics of Program Construction (MPC 06).
43:
151:
124:
17:
229:
262:
241:
179:
Volume 4, Fascicle 2: Generating All Tuples and
Permutations
89:
takes linear time in the size of the input. The standard
46:
that generates successive combinatorial objects, such as
313:
333:
8:
118:
116:
340:
326:
150:
212:
210:
112:
7:
294:
292:
25:
296:
183:The Art of Computer Programming
258:Loopless Functional Algorithms
222:Loopless functional algorithms
77:algorithm that takes the form
1:
71:loopless functional algorithm
37:loopless imperative algorithm
312:. You can help Knowledge by
255:Snape, J. (September 2005).
191:Addison–Wesley Professional
380:
291:
123:Ehrlich, G. (July 1973).
359:Combinatorial algorithms
187:Upper Saddle River, N.J.
85:takes constant time and
62:and the first object in
96:is a right-associative
308:-related article is a
152:10.1145/321765.321781
79:unfoldr step • prolog
271:University of Oxford
364:Combinatorics stubs
261:. Master's thesis.
130:Journal of the ACM
33:loopless algorithm
321:
320:
177:(February 2005).
27:In computational
16:(Redirected from
371:
342:
335:
328:
300:
293:
283:
282:
252:
246:
245:
242:10.1007/11783596
214:
205:
204:
171:
165:
164:
154:
120:
21:
379:
378:
374:
373:
372:
370:
369:
368:
349:
348:
347:
346:
289:
287:
286:
254:
253:
249:
216:
215:
208:
201:
173:
172:
168:
122:
121:
114:
109:
23:
22:
15:
12:
11:
5:
377:
375:
367:
366:
361:
351:
350:
345:
344:
337:
330:
322:
319:
318:
301:
285:
284:
247:
206:
199:
166:
139:New York, N.Y.
111:
110:
108:
105:
24:
14:
13:
10:
9:
6:
4:
3:
2:
376:
365:
362:
360:
357:
356:
354:
343:
338:
336:
331:
329:
324:
323:
317:
315:
311:
307:
306:combinatorics
302:
299:
295:
290:
280:
276:
272:
268:
264:
260:
259:
251:
248:
243:
239:
235:
231:
227:
223:
220:(July 2006).
219:
213:
211:
207:
202:
200:0-201-85393-0
196:
192:
188:
184:
180:
176:
170:
167:
162:
158:
153:
148:
144:
140:
136:
132:
131:
126:
119:
117:
113:
106:
104:
102:
99:
95:
92:
88:
84:
80:
76:
72:
67:
65:
61:
60:constant time
57:
53:
49:
45:
42:
38:
34:
30:
29:combinatorics
19:
314:expanding it
303:
288:
257:
250:
221:
178:
169:
134:
128:
93:
86:
82:
78:
70:
68:
56:combinations
52:permutations
36:
32:
26:
145:: 500–513.
64:linear time
353:Categories
226:Heidelberg
107:References
75:functional
48:partitions
41:imperative
175:Knuth, D.
161:0004-5411
44:algorithm
279:63162239
234:Springer
218:Bird, R.
91:function
18:Loopless
230:Germany
94:unfoldr
277:
263:Oxford
197:
159:
101:unfold
87:prolog
81:where
54:, and
39:is an
304:This
137:(3).
73:is a
58:, in
310:stub
275:OCLC
267:U.K.
195:ISBN
157:ISSN
98:Bird
83:step
31:, a
238:doi
147:doi
143:ACM
35:or
355::
273:.
269::
265:,
236:.
232::
228:,
209:^
193:.
189::
185:.
181:.
155:.
141::
135:20
133:.
127:.
115:^
103:.
69:A
50:,
341:e
334:t
327:v
316:.
281:.
244:.
240::
203:.
163:.
149::
20:)
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.