AI & ChatGPT searches , social queries for UZI VISHKIN
Search references for UZI VISHKIN. Phrases containing UZI VISHKIN
See searches and references containing UZI VISHKIN!
Search references for UZI VISHKIN. Phrases containing UZI VISHKIN
See searches and references containing UZI VISHKIN!UZI VISHKIN
Israeli-American computer scientist
Uzi Vishkin (Hebrew: עוזי וישקין; born 1953) is a computer scientist at the University of Maryland, College Park, where he is Professor of Electrical
Uzi_Vishkin
Topics referred to by the same term
Vishkin may refer to: Uzi Vishkin Vishkin, Iran This disambiguation page lists articles associated with the title Vishkin. If an internal link incorrectly
Vishkin
known for challenging programmers. The XMT paradigm was introduced by Uzi Vishkin. The Explicit Multi-Threading (XMT) computing paradigm integrates several
Explicit_multi-threading
Tree node with two other nodes as descendants
ancestors of an offline batch of pairs of nodes. Baruch Schieber and Uzi Vishkin (1988) simplified the data structure of Harel and Tarjan, leading to
Lowest_common_ancestor
Topics referred to by the same term
defense engineer and analyst Uzi Vishkin (born 1953), Israeli American professor of computer science and engineering Uzi Doorman, the main character of
Uzi_(disambiguation)
Methodic assignment of colors to elements of a graph
side. The simplest interesting case is an n-cycle. Richard Cole and Uzi Vishkin show that there is a distributed algorithm that reduces the number of
Graph_coloring
Sequence in computer science
unit dedicated to computing multi-parameter prefix-sum was patented by Uzi Vishkin. Many parallel implementations follow a two pass procedure where partial
Prefix_sum
Inverse function to a tower of powers
as the median): lg* n − 1 ± 3 parallel operations. Richard Cole and Uzi Vishkin's distributed algorithm for 3-coloring an n-cycle: O(log* n) synchronous
Iterated_logarithm
Anatoly Vershik Victor Vianu Jonathan David Victor Mathukumalli Vidyasagar Uzi Vishkin Vadim G. Vizing Margit Voigt José Felipe Voloch Richard von Mises Marc
List of people by Erdős number
List_of_people_by_Erdős_number
Maximal biconnected subgraph
inverse Ackermann function. This time bound is proved to be optimal. Uzi Vishkin and Robert Tarjan (1985) designed a parallel algorithm on CRCW PRAM that
Biconnected_component
Abstract computer for designing parallel algorithms
Practical PRAM Programming. John Wiley and Sons. ISBN 0-471-35351-5. Vishkin, Uzi (2009), Thinking in Parallel: Some Basic Data-Parallel Algorithms and
Parallel_RAM
Computing system
computing systems, US patents 7,707,388, 2010 and 8,145,879, 2012. Inventor: Uzi Vishkin Wikimedia Commons has media related to Heterogeneous System Architecture
Heterogeneous System Architecture
Heterogeneous_System_Architecture
Digital processing technique
pdf. Saybasili, A. Beliz, Alexandros Tzannes, Bernard R. Brooks, and Uzi Vishkin. "Highly Parallel Multi-Dimensional Fast Fourier Transform on Fine-and
Parallel multidimensional digital signal processing
Parallel_multidimensional_digital_signal_processing
Algorithm in mathematical optimization
them into the parallel maximum flow algorithm of Yossi Shiloach and Uzi Vishkin. Let: G = (V, E) be a network with capacity function c: V × V → ℝ∞, F
Push–relabel maximum flow algorithm
Push–relabel_maximum_flow_algorithm
John A. Stankovic Larry Stockmeyer Andrew S. Tanenbaum Mary K. Vernon Uzi Vishkin Jeffrey S. Vitter Anthony I. Wasserman Mark Wegman Fred W. Weingarten
List of fellows of the Association for Computing Machinery
List_of_fellows_of_the_Association_for_Computing_Machinery
Finding strings that approximately match a pattern
Cambridge University Press. ISBN 978-0-521-58519-4. Landau, Gad M.; Vishkin, Uzi (1989). "Fast Parallel and Serial Approximate String Matching". Journal
Approximate_string_matching
Subfield of computer science
provide reasonable bounds on the computation time. Shiloach, Yossi; Vishkin, Uzi (1982). "An O(n2 log n) parallel max-flow algorithm". Journal of Algorithms
Analysis of parallel algorithms
Analysis_of_parallel_algorithms
Annual award in parallel and distributed processing
contributions to the field of Parallel Computational Biology." 2026 - Uzi Vishkin. "For seminal contributions to the theory of PRAM computing, and for
IEEE Computer Society Charles Babbage Award
IEEE_Computer_Society_Charles_Babbage_Award
Equivalence between strongly orientable graphs and bridgeless graphs
Algorithms, 9 (2): 205–223, doi:10.1016/0196-6774(88)90038-7, MR 0936106. Vishkin, Uzi (1985), "On efficient parallel strong orientation", Information Processing
Robbins'_theorem
Comput. Sci. 321: 5–12. doi:10.1016/j.tcs.2003.05.002. Berkman, Omer; Vishkin, Uzi (Apr 1994). "Finding level-ancestors in trees". J. Comput. Syst. Sci
Level_ancestor_problem
Professor of computer science
the design and analysis of parallel algorithms was supervised by Dr. Uzi Vishkin. From 1987 to 1989 Schieber was a Postdoctoral Fellow at the Theory of
Baruch_Schieber
Binary tree derived from a sequence of numbers
in Computer Science 1776, pp. 88–94 Berkman, Omer; Schieber, Baruch; Vishkin, Uzi (1993), "Optimal doubly logarithmic parallel algorithms based on finding
Cartesian_tree
Israeli computer scientist
days of his scientific career. His Ph.D. thesis, supervised by Prof. Uzi Vishkin, includes the fundamental text-book solution for the k-differences problem
Gad_Landau
Algorithm which can do multiple operations in a given time
Computer Science, Carnegie Mellon University. Retrieved 2015-07-27. Vishkin, Uzi (2009). "Thinking in Parallel: Some Basic Data-Parallel Algorithms and
Parallel_algorithm
research team at the University of Maryland, College Park, led by Dr. Uzi Vishkin. The philosophy of XMTC and the whole XMT project is that parallel programming
XMTC
Letters, 33 (5): 269–273, doi:10.1016/0020-0190(90)90196-5. Cole, Richard; Vishkin, Uzi (1989), "Faster optimal parallel prefix sums and list ranking", Information
List_ranking
Abstract data type
1007/BF01840359. MR 0895444. S2CID 7932878.. Berkman, Omer; Schieber, Baruch; Vishkin, Uzi (1993). "Optimal doubly logarithmic parallel algorithms based on finding
Stack_(abstract_data_type)
exist, e.g. the (extended) coin-tossing technique by Richard Cole and Uzi Vishkin. Schneider (2010) Schneider (2008) Schneider, J. (2010), "A new technique
Multi-trials_technique
197–215, doi:10.1006/jagm.1997.0905. Berkman, Omer; Schieber, Baruch; Vishkin, Uzi (1993), "Optimal doubly logarithmic parallel algorithms based on finding
All_nearest_smaller_values
Concept in computer science
oblivious Funnelsort to merge elements. Berkman, Omer; Schieber, Baruch; Vishkin, Uzi (1993), "Optimal doubly logarithmic parallel algorithms based on finding
Doubly_logarithmic_tree
Trail in a graph that visits each edge once
Technology. 15 (1): 85–92. doi:10.2498/cit.1000731. Tarjan, Robert E.; Vishkin, Uzi (1985). "An efficient parallel biconnectivity algorithm". SIAM Journal
Eulerian_path
Maximum size of an independent set of the matroid
Dover Publications, pp. 27–30, ISBN 9780486419756. Coppersmith, Don; Vishkin, Uzi (1985), "Solving NP-hard problems in 'almost trees': Vertex cover", Discrete
Matroid_rank
Branch of computational complexity theory
ISBN 978-1107057760. S2CID 263888582. Gurevich, Yuri; Stockmeyer, Larry; Vishkin, Uzi (1984). Solving NP-hard problems on graphs that are almost trees and
Parameterized_complexity
System with multiple networked computers
original on 2009-08-06, retrieved 2009-07-16. Articles Cole, Richard; Vishkin, Uzi (1986), "Deterministic coin tossing with applications to optimal parallel
Distributed_computing
Minimizing problem in computer programming
A-1[j] (otherwise swap). Range query (data structures) Berkman, Omer; Vishkin, Uzi (1993). "Recursive Star-Tree Parallel Data Structure". SIAM Journal on
Range_minimum_query
German computer scientist (born 1949)
1145/800070.802208, ISBN 978-0897910705, S2CID 17932779. Mehlhorn, Kurt; Vishkin, Uzi (November 1984), "Randomized and deterministic simulations of PRAMs by
Kurt_Mehlhorn
Computational complexity class
(5): 329–339, arXiv:2306.11185, doi:10.7155/jgaa.00625 Megiddo, Nimrod; Vishkin, Uzi (1988), "On finding a minimum dominating set in a tournament", Theoretical
Quasi-polynomial_time
Tree containing all suffixes of a given text
NY, USA: ACM, pp. 833–844, CiteSeerX 10.1.1.81.6031. Sahinalp, Cenk; Vishkin, Uzi (1994), "Symmetry breaking for suffix tree construction", ACM Symposium
Suffix_tree
Design technique for parallel algorithms
Parallel Computations (Thesis). Cornell University. Shiloach, Yossi; Vishkin, Uzi (1982). "An O(log n) Parallel Connectivity Algorithm". Journal of Algorithms
Pointer_jumping
Software that provides access that hides details
Jeffrey (29 July 2008). "The Onion Architecture". Jeffrey Palermo. Vishkin, Uzi (January 2011). "Using simple abstraction to reinvent computing for parallelism"
Abstraction (computer science)
Abstraction_(computer_science)
Algorithm for computing convex hulls in a set of points
ISBN 978-3-642-62442-1. MR 2038472. Berkman, Omer; Schieber, Baruch; Vishkin, Uzi (1993). "Optimal double logarithmic parallel algorithms based on finding
Graham_scan
Fewest graph edges whose removal breaks all cycles
Press, p. 349, ISBN 0-521-86565-4, Zbl 1106.05001 Coppersmith, Don; Vishkin, Uzi (1985), "Solving NP-hard problems in 'almost trees': Vertex cover", Discrete
Cyclomatic_number
Special case of graph labeling in graph theory
CiteSeerX 10.1.1.471.6378, doi:10.1137/0221015, MR 1148825. Cole, Richard; Vishkin, Uzi (1986), "Deterministic coin tossing with applications to optimal parallel
Weak_coloring
UZI VISHKIN
UZI VISHKIN
Boy/Male
Egyptian
Life.
Girl/Female
Indian, Telugu
Uni-dimensional
Male
Hebrew
(×וּדִי) Pet form of Hebrew Ehuwd, UDI means "joining together, united."
Girl/Female
Biblical
My strength, my kid.
Girl/Female
Biblical
My light, my fire.
Girl/Female
Hindu, Indian, Marathi, Sanskrit
Wish; Desire; Kindness; Enjoyment
Boy/Male
German, Hebrew
Strong
Girl/Female
Basque, German
Mistress of All; Noble Leader; Wealthy
Boy/Male
Egyptian
Smoke.
Male
English
Variant spelling of English Uzzia, UZIA means "power of Jehovah."Â
Male
English
Variant spelling of English Unni, UNI means "afflicted, depressed."
Male
Hebrew
(עֻזָּה, ×¢Ö»×–Ö¼Ö¸×) Variant spelling of Hebrew Uzza, UZA means "power, strength."Â
Girl/Female
German
Mistress of all.
Girl/Female
Biblical
My contempt.
Boy/Male
Biblical
He.
Male
Hebrew
Short form of Hebrew Uziya, UZI means "power of Jehovah."Â
Male
English
Anglicized form of Hebrew Uwriy, URI means "fiery" or "my flame, my light." In the bible, this is the name of several characters, including a prince of Judah.Â
Male
Hebrew
Short form of Hebrew Uzziya, UZZI means "power of Jehovah."
Boy/Male
African
youth'.
Boy/Male
Norse
A Dane.
UZI VISHKIN
UZI VISHKIN
UZI VISHKIN
UZI VISHKIN
UZI VISHKIN
UZI VISHKIN
UZI VISHKIN