דילוג לניווט ראשי
דילוג לחיפוש
דילוג לתוכן הראשי
האוניברסיטה הפתוחה בית
עזרה ושאלות נפוצות
!!Link opens in a new tab
English
עברית
العربية
!!Search content at האוניברסיטה הפתוחה
בית
פרופילים
יחידות מחקר
פרסומים מחקריים
פרסים
פעילויות
הצגת פרופיל Scopus
לאוניד ברנבוים
פרופ'
Associate_Professor
,
מדעי המחשב
https://orcid.org/0000-0002-9021-3549
דוא"ל
leonidb
openu.ac
il
2008
2025
פעילות מחקר לפי שנה
סקירה כללית
טביעת אצבע
רשת
פרסומים מחקריים
(56)
טביעת אצבע
תחומי מחקר אלו נובעים מהפרסומים המדעיים של אדם זה. יחד הם יוצרים טביעת אצבע ייחודית.
מיון לפי
משקל
לפי סדר האלפבית
Keyphrases
2-coloring
20%
Arboricity
36%
Backup Placement
40%
Bounded Arboricity
23%
Coloring Algorithm
55%
Coloring Problem
20%
Combinatorial Algorithms
17%
CONGEST
20%
Constant Time
20%
Decomposition Algorithm
21%
Defective Coloring
17%
Deterministic Algorithm
47%
Distributed Algorithms
90%
Distributed Backup
29%
Distributed Computing
34%
Distributed Graph Coloring
17%
Distributed Setting
27%
Distributed Symmetry Breaking
59%
Dynamic Networks
21%
Edge Coloring
82%
Energy Efficiency
22%
Faulty Network
17%
Forest Decomposition
26%
General Graphs
39%
Graph Coloring
52%
Graph Families
34%
Hardness Assumptions
17%
Iterative Algorithm
27%
Large Families
28%
Log-log
76%
Maximal Independent Set
54%
Maximal Matching
47%
Maximum Degree
39%
Message Passing Model
26%
Nash-Williams
17%
Network Clustering
20%
Network Decomposition
29%
Polylogarithmic Time
23%
Radio
23%
Randomized Algorithms
20%
Round numbers
29%
Self-stabilization
20%
Small Constants
22%
Static Networks
17%
Static-dynamic
17%
Symmetry Breaking
23%
Thomas Kuhn
25%
Update Time
20%
Vertex Coloring
78%
Wireless Sensor Networks
26%
Computer Science
Algebraic Algorithm
17%
Approximation (Algorithm)
26%
Approximation Algorithms
17%
Autonomous Vehicles
8%
Case Complexity
17%
Clock Synchronization
11%
Clustering Algorithm
11%
Coloring Problem
77%
Communication Network
32%
Distributed Algorithm
86%
Distributed Computation
17%
Distributed Computing
51%
Distributed Model
13%
Energy Consumption
17%
Energy Efficiency
33%
Experimental Result
8%
Fundamental Problem
13%
Fundamental Question
11%
Graph Algorithms
17%
Graph Coloring
46%
Hyperedges
8%
Iterative Algorithm
26%
Life Cycle Assessment
17%
Load Balancing
17%
Local Algorithm
8%
Main Memory
8%
Matching Algorithm
9%
Maximal Independent Set
70%
Maximal Matching
61%
Maximum Matching
8%
Message Passing
67%
Minimal Amount
8%
Network Lifetime
13%
Neural Network
8%
Placement Algorithm
10%
Planar Graph
10%
Randomized Algorithm
51%
Sampling Technique
13%
Sensor Network
14%
Software Defined Networking
8%
Speed-up
17%
Subgraphs
46%
Synchronism
31%
Topology Graph
14%
Transferring Data
8%
Transmitted Data
8%
Virtual Memory
8%
Wireless Connectivity
8%
Wireless Network
22%
Wireless Sensor Network
29%
Mathematics
Arboricity
60%
Clique
16%
Combinatorial Algorithm
17%
Connected Graph
5%
Conservation of Energy
17%
Constant Time
20%
Decomposition Algorithms
19%
Defectives
13%
Discrete Time
5%
Edge
54%
Graph Algorithm
8%
Graph Coloring
30%
Independent Set
60%
Low Degree
5%
Lowest Common Ancestor
17%
Maximum Degree
31%
Minimizes
5%
Multiplicative Constant
5%
Open Question
11%
Planar Graph
15%
Polynomial
5%
Positive Integer
5%
Probability
11%
Running Time
100%
Sampling Technique
13%
Sparse Graphs
17%
Sublogarithmic Algorithm
8%
Symmetry Breaking
38%
Time Unit
5%
Topology
5%
Unit Disk
7%
