default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDElena V. Ravve
Person information
- affiliation: ORT Braude College, Department of Software Engineering, Karmiel, Israel
- affiliation (former, PhD 1999,): Technion - Israel Institute of Technology, Haifa, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2025
[p1]Katerina Korenblat, Elena V. Ravve:
On Consistency of Graphically Defined Specifications. Festschrift in Honor of Johann A. Makowsky 2025: 465-483- [e2]Klaus Meer, Alexander Rabinovich, Elena V. Ravve, Andrés Villaveces:
Model Theory, Computer Science, and Graph Polynomials: Festschrift in Honor of Johann A. Makowsky. Trends in Mathematics, Springer Nature Switzerland 2025, ISBN 978-3-031-86319-6 [contents] - 2024
- [j11]Zeev Volkovich, Elena V. Ravve, Renata Avros:
Indoor Navigation in Facilities with Repetitive Structures. Sensors 24(9): 2876 (2024) - 2023
- [c16]Renata Avros, Dan Lemberg, Elena V. Ravve
, Zeev Volkovich:
An Approach to Predicting Social Events via Dailies Tracking. IWANN (2) 2023: 280-291 - 2020
- [c15]Elena V. Ravve:
Logic-Based Approach to Incremental Monitoring and Optimization on Strongly Distributed Data Streams. FoIKS 2020: 242-262
2010 – 2019
- 2019
- [j10]Johann A. Makowsky, Elena V. Ravve, Tomer Kotek:
A logician's view of graph polynomials. Ann. Pure Appl. Log. 170(9): 1030-1069 (2019) - [c14]Katerina Korenblat, Elena V. Ravve:
Automatic Code Generator for Screen Based Systems. ADBIS (Short Papers and Workshops) 2019: 253-265 - 2018
- [j9]Tomer Kotek, Johann A. Makowsky, Elena V. Ravve:
On sequences of polynomials arising from graph invariants. Eur. J. Comb. 67: 181-198 (2018) - 2017
- [j8]Yuri S. Popkov, Zeev Volkovich, Yu. A. Dubnov, Renata Avros, Elena V. Ravve:
Entropy "2"-Soft Classification of Objects. Entropy 19(4): 178 (2017) - 2016
- [j7]Valery M. Kirzhner, Zeev Volkovich, Elena V. Ravve, Gerhard-Wilhelm Weber:
An estimate of the objective function optimum for the network Steiner problem. Ann. Oper. Res. 238(1-2): 315-328 (2016) - [j6]Elena V. Ravve:
Incremental computations over strongly distributed databases. Concurr. Comput. Pract. Exp. 28(11): 3061-3076 (2016) - [c13]Elena V. Ravve:
Maintenance of Queries Under Database Changes: A Unified Logic Based Approach. FoIKS 2016: 191-208 - [c12]Johann A. Makowsky, Elena V. Ravve:
Semantic Equivalence of Graph Polynomials Definable in Second Order Logic. WoLLIC 2016: 279-296 - 2015
- [c11]Elena V. Ravve, Zeev Volkovich, Gerhard-Wilhelm Weber:
A Uniform Approach to Incremental Automated Reasoning on Strongly Distributed Structures. GCAI 2015: 229-251 - [c10]Elena V. Ravve, Zeev Volkovich, Gerhard-Wilhelm Weber:
Automatic Definition of Optimal Default Parameters of Models: Image Matting Application. SYNASC 2015: 251-254 - [c9]Elena V. Ravve, Zeev Volkovich, Gerhard-Wilhelm Weber:
Incremental Reasoning on Strongly Distributed Multi-agent Systems. SYNASC 2015: 415-422 - 2014
- [j5]Johann A. Makowsky, Elena V. Ravve, N. K. Blanchard:
On the location of roots of graph polynomials. Eur. J. Comb. 41: 1-19 (2014) - [c8]Elena V. Ravve:
Views and Updates over Distributed Databases. SYNASC 2014: 341-348 - [c7]Elena V. Ravve:
Analyzing WMSOL Definable Properties on Sum-Like Weighted Labeled Trees. SYNASC 2014: 375-382 - 2013
- [j4]Johann A. Makowsky, Elena V. Ravve:
On the Location of Roots of Graph Polynomials. Electron. Notes Discret. Math. 43: 201-206 (2013) - [c6]Elena V. Ravve, Zeev Volkovich:
A Systematic Approach to Computations on Decomposable Graphs. SYNASC 2013: 398-405 - 2012
- [c5]Johann A. Makowsky, Elena V. Ravve:
BCNF via Attribute Splitting. Conceptual Modelling and Its Theoretical Foundations 2012: 73-84 - [c4]Tomer Kotek, Johann A. Makowsky, Elena V. Ravve:
A Computational Framework for the Study of Partition Functions and Graph Polynomials. SYNASC 2012: 365-368 - 2011
- [j3]Ilya Averbouch, Tomer Kotek, Johann A. Makowsky, Elena V. Ravve:
The Universal Edge Elimination Polynomial and the Dichromatic Polynomial. Electron. Notes Discret. Math. 38: 77-82 (2011)
2000 – 2009
- 2008
- [j2]Eldar Fischer, Johann A. Makowsky, Elena V. Ravve:
Counting truth assignments of formulas of bounded tree-width or clique-width. Discret. Appl. Math. 156(4): 511-529 (2008)
1990 – 1999
- 1999
- [b1]Elena V. Ravve:
Decomposition of databases with translation schemes. Technion - Israel Institute of Technology, Israel, 1999 - 1998
- [j1]Johann A. Makowsky, Elena V. Ravve:
Dependency Preserving Refinements and the Fundamental Problem of Database Design. Data Knowl. Eng. 24(3): 277-312 (1998) - [e1]Johann A. Makowsky, Elena V. Ravve:
Proceedings of the Annual European Summer Meeting of the Association of Symbolic Logic, Logic Colloquium 1995, Haifa, Israel, August 9-18, 1995. Lecture Notes in Logic 11, Springer 1998, ISBN 978-3-540-63994-7 [contents] - 1997
- [c3]Johann A. Makowsky, Elena V. Ravve:
The Fundamental Problem of Database Design. SOFSEM 1997: 53-69 - 1996
- [c2]Johann A. Makowsky, Elena V. Ravve:
Translation Schemes and the Fundamental Problem of Database Design. ER 1996: 5-26 - 1995
- [c1]Johann A. Makowsky, Elena V. Ravve:
Incremental Model Checking for Decomposable Structures (Extended Abstract). MFCS 1995: 540-551
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-07-30 23:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
