![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Yaakov L. Varol
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2005
- [j14]Lillian N. Cassel, Anneke Hacquebard, Andrew D. McGettrick, Gordon Davies, Richard J. LeBlanc, Charles Riedesel, Yaakov L. Varol, Gail T. Finley, Samuel Mann, Robert H. Sloan:
A synthesis of computing concepts. ACM SIGCSE Bull. 37(4): 162-172 (2005) - [c7]Sergiu M. Dascalu, Norm Brown, Derek A. Eiler, Herman W. Leong, Nathan A. Penrod, Brian T. Westphal, Yaakov L. Varol:
Software Modeling of S-Metrics Visualizer: Synergetic Interactive Metrics Visualization Tool. Software Engineering Research and Practice 2005: 870-876 - 2003
- [c6]Xiaojing Yuan, Zehang Sun, Yaakov L. Varol, George Bebis:
A Distributed Visual Surveillance System. AVSS 2003: 199-204 - 2002
- [j13]Spyros Tragoudas, Yaakov L. Varol:
Disjoint Paths with Length Constraints. Int. J. Comput. Their Appl. 9(3): 158-166 (2002) - [j12]George Bebis, Evangelos A. Yfantis, Sushil J. Louis, Yaakov L. Varol:
Genetic object recognition using combinations of views. IEEE Trans. Evol. Comput. 6(2): 132-146 (2002)
1990 – 1999
- 1999
- [c5]Spyros Tragoudas, Yaakov L. Varol:
Disjoint paths with length constraints. CATA 1999: 277-280 - 1998
- [j11]Kaijung Chang, Yan Huat Tan, Yaakov L. Varol, Jiang-Hsing Chu:
A Study on Interleaving Versus Segmentation. Inf. Process. Lett. 65(6): 319-324 (1998) - [c4]Sushil J. Louis, George Bebis, Satish Uthiram, Yaakov L. Varol:
Genetic Search for Object Identification. Evolutionary Programming 1998: 199-208 - 1996
- [c3]Spyros Tragoudas, Yaakov L. Varol:
Computing Disjoint Path with Lenght Constraints. WG 1996: 375-389 - 1995
- [c2]Kaijung Chang, Yan Huat Tan, Yaakov L. Varol, Jiang-Hsing Chu:
Analysis of Load Partitioning: Segmentation vs. Interleave. Parallel and Distributed Computing and Systems 1995: 202-205
1980 – 1989
- 1986
- [j10]Raj Sekhar Pamula, Suchai Thanawastien, Yaakov L. Varol:
On selecting rollback points for error recovery. Inf. Sci. 38(3): 283-292 (1986) - 1984
- [j9]Alan D. Kalvin, Yaakov L. Varol:
On Two Problems Reducible to Topological Sorting. Comput. J. 27(2): 176-177 (1984) - [c1]Yaakov L. Varol, Susan V. Vrbsky:
Distributed Query Processing Allowing for Redundant Data. ICDCS 1984: 389-396 - 1983
- [j8]Alan D. Kalvin, Yaakov L. Varol:
On the Generation of All Topological Sortings. J. Algorithms 4(2): 150-162 (1983) - 1981
- [j7]Yaakov L. Varol, Doron Rotem:
An Algorithm to Generate all Topological Sorting Arrangements. Comput. J. 24(1): 83-84 (1981) - [j6]Yaakov L. Varol, Doron Rotem:
Some Experiences with the Johnson-Trotter Permutation Generation Algorithm. Comput. J. 24(2): 173-176 (1981) - [j5]Lloyd K. Konneker, Yaakov L. Varol:
A Note on Heuristics for Dynamic Organization of Data Structures. Inf. Process. Lett. 12(5): 213-216 (1981) - 1980
- [j4]Yaakov L. Varol:
On a Subset of all the Permutations of n Marks. Comput. J. 23(4): 344-346 (1980)
1970 – 1979
- 1978
- [j3]Doron Rotem, Yaakov L. Varol:
Generation of Binary Trees from Ballot Sequences. J. ACM 25(3): 396-404 (1978) - 1977
- [j2]Yaakov L. Varol:
On the Generation of the Pseudo-Remainder in Polynomial Division. Comput. J. 20(2): 178-180 (1977) - 1976
- [j1]Yaakov L. Varol:
Some Remarks on Computer Acquisition. Comput. J. 19(2): 127-131 (1976)
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 20:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint