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