
doi: 10.1007/bf01930902
A function is presented to test equality between lists. In any case the function requires at most one single traversal of the lists and behaves as follows: -- if there are no cycles, it works as standardEQU AL functions; -- if there are cycles, it does not give information about equality, but it can detect cycles, i.e. it signals which lists are cyclic.
Data structures, General topics in the theory of software
Data structures, General topics in the theory of software
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
