דילוג לניווט ראשי
דילוג לחיפוש
דילוג לתוכן הראשי
האוניברסיטה הפתוחה בית
עזרה ושאלות נפוצות
English
עברית
العربية
בית
פרופילים
יחידות מחקר
פרסומים מחקריים
פרסים
פעילויות
חיפוש לפי מומחיות, שם או שיוך
הצגת פרופיל Scopus
לאוניד ברנבוים
פרופ'
Associate_Professor
,
מדעי המחשב
https://orcid.org/0000-0002-9021-3549
דוא"ל
leonidb
openu.ac
il
2008
2024
פעילות מחקר לפי שנה
סקירה כללית
טביעת אצבע
רשת
פרסומים מחקריים
(47)
פרופילים דומים
(5)
טביעת אצבע
תחומי מחקר אלו נובעים מהפרסומים המדעיים של אדם זה. יחד הם יוצרים טביעת אצבע ייחודית.
מיון לפי
משקל
לפי סדר האלפבית
Keyphrases
Arboricity
30%
Backup Placement
37%
Bounded Arboricity
21%
Coloring Algorithm
50%
Coloring Problem
18%
Combinatorial Algorithms
16%
Constant Time
18%
Decomposition Algorithm
19%
Defective Coloring
16%
Deterministic Algorithm
43%
Distributed Algorithms
67%
Distributed Backup
26%
Distributed Computing
31%
Distributed Graph Coloring
16%
Distributed Settings
24%
Distributed Symmetry Breaking
54%
Dynamic Graph Algorithms
16%
Dynamic Networks
19%
Edge Coloring
72%
Energy Efficiency
20%
Energy Optimal
16%
Faulty Network
16%
Forest Decomposition
26%
Fully Dynamic Graphs
16%
General Graphs
36%
Graph Coloring
48%
Graph Families
31%
Hardness Assumptions
16%
Iterative Algorithm
25%
Kuhn
21%
Large Families
26%
Log-log
61%
Maximal Independent Set
39%
Maximal Matching
39%
Maximum Degree
31%
Message Passing Model
22%
Network Cluster
18%
Network Decomposition
26%
Polylogarithmic Time
22%
Radio
21%
Randomized Algorithms
16%
Round numbers
20%
Self-stabilization
19%
Static Networks
16%
Static-dynamic
16%
Symmetry Breaking
21%
Update Time
19%
Vertex Coloring
68%
Wireless Sensor Networks
32%
Wireless Synchronization
16%
Computer Science
Algebraic Algorithm
16%
Approximation (Algorithm)
24%
Approximation Algorithms
16%
Autonomous Vehicles
8%
Case Complexity
16%
Clock Synchronization
10%
Clustering Algorithm
11%
Coloring Problem
75%
Communication Network
28%
Distributed Algorithm
71%
Distributed Computation
16%
Distributed Computing
51%
Distributed Model
8%
Efficient Algorithm
8%
Energy Efficiency
23%
Experimental Result
8%
Fault Tolerant
8%
Fundamental Problem
12%
Fundamental Question
10%
Graph Algorithms
16%
Graph Coloring
46%
Hyperedges
8%
Iterative Algorithm
32%
Life Cycle Assessment
8%
Load Balancing
16%
Local Algorithm
8%
Main Memory
8%
Matching Algorithm
9%
Maximal Independent Set
54%
Maximal Matching
52%
Maximum Matching
8%
Message Passing
57%
Minimal Amount
8%
Neural Network
8%
Placement Algorithm
9%
Planar Graph
9%
Randomized Algorithm
45%
Sampling Technique
8%
Software Defined Networking
8%
Speed-up
16%
Subgraphs
47%
Theoretical Computer Science
8%
Topology Graph
13%
Transferring Data
8%
Transmitted Data
8%
Virtual Memory
8%
Wireless Connectivity
8%
Wireless Networks
20%
Wireless Sensor Network
16%
Wireless Sensor Network
10%
Mathematics
Arboricity
43%
Clique
18%
Combinatorial Algorithm
16%
Communicates
6%
Connected Graph
16%
Constant Factor
8%
Constant Time
26%
Decomposition Algorithms
17%
Defectives
5%
Discrete Time
16%
Edge
17%
Free Graph
6%
Graph Coloring
26%
Independent Set
39%
Maximum Degree
18%
Minimizes
16%
Multiplicative Constant
16%
Open Problem
8%
Open Question
21%
Planar Graph
14%
Polynomial
5%
Positive Integer
16%
Probability Theory
26%
Running Time
100%
Seminal Paper
8%
Sparse Graphs
16%
Sublogarithmic Algorithm
8%
Symmetry Breaking
35%
time interval τ
16%
time point η
16%
Time Unit
16%
Unit Disk
20%
