◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

G. Oren

46 papers hereh-index 14502 citations80 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author1
  • first author4
  • middle author7
  • last author32

Across the 44 of 46 papers where every author was matched, so the position is known.

fields
  • cs.DC24
  • cs.CV8
  • cs.CL2
  • cs.LG2
  • cond-mat.mtrl-sci1
  • cs.AI1
same name
  • G. Oren — 1 paper, h 3

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20172026
most citedOMPGPT: A Generative Pre-trained Transformer Model for OpenMP

24 citations · 56 across the 45 of their papers we have counts for

collaborators
Showing 2019Show all

4 papers · 1 filter

cs.DC2019★ 3 cited

BACKUS: Comprehensive High-Performance Research Software Engineering Approach for Simulations in Supercomputing Systems

Matan Rusanovsky, Re'em Harel, Lee-or Alon +3

High-Performance Computing (HPC) platforms enable scientific software to achieve breakthroughs in many research fields such as physics, biology, and chemistry, by employing Researc…

cs.DC2019★ 2 cited

Distributed Backup Placement in One Round and its Applications to Maximum Matching Approximation and Self-Stabilization

Leonid Barenboim, Gal Oren

In the distributed backup-placement problem each node of a network has to select one neighbor, such that the maximum number of nodes that make the same selection is minimized. This…

cs.CV2019★ 1 cited

Cooperative image captioning

Gilad Vered, Gal Oren, Yuval Atzmon +1

When describing images with natural language, the descriptions can be made more informative if tuned using downstream tasks. This is often achieved by training two networks: a "spe…

cs.DC2019★ 1 cited

Fast Distributed Backup Placement in Sparse and Dense Networks

Leonid Barenboim, Gal Oren

We consider the Backup Placement problem in networks in the CONGEST distributed setting. Given a network graph G=(V,E), the goal of each vertex v∈V is selecti…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.