default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAmihood Amir
Person information
- affiliation: Bar-Ilan University, Ramat Gan, Israel
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j100]Ora Amir, Amihood Amir
, Aviezri Fraenkel, David Sarne:
On the Practical Power of Automata in Pattern Matching. SN Comput. Sci. 5(4): 400 (2024)- [j99]Amihood Amir, Eitan Kondratovsky, Gad M. Landau, Shoshana Marcus, Dina Sokol:
Reconstructing parameterized strings from parameterized suffix and LCP arrays. Theor. Comput. Sci. 981: 114230 (2024) - [j98]Amihood Amir, Eitan Kondratovsky, Avivit Levy:
On suffix tree detection. Theor. Comput. Sci. 1012: 114728 (2024) - [c128]Amihood Amir, Michael Itzhaki:
Reconstructing General Matching Graphs. CPM 2024: 2:1-2:15 - [c127]Amihood Amir, Eitan Kondratovsky, Shoshana Marcus, Dina Sokol:
Linear Time Reconstruction of Parameterized Strings from Parameterized Suffix and LCP Arrays for Constant-Sized Alphabets. SPIRE 2024: 1-15 - [i20]Amihood Amir, Michael Itzhaki:
Explicit Combinatoric Structures of Palindromes and Chromatic Number of Restriction Graphs. CoRR abs/2406.04507 (2024) - 2023
- [j97]Amihood Amir, Ayelet Butman, Gad M. Landau, Shoshana Marcus, Dina Sokol:
Double String Tandem Repeats. Algorithmica 85(1): 170-187 (2023) - [c126]Amihood Amir, Eitan Kondratovsky, Avivit Levy:
On Suffix Tree Detection. SPIRE 2023: 14-27 - 2022
- [j96]Amihood Amir, Ayelet Butman, Eitan Kondratovsky, Avivit Levy, Dina Sokol:
Multidimensional Period Recovery. Algorithmica 84(6): 1490-1510 (2022) - [c125]Amihood Amir, Concettina Guerra, Eitan Kondratovsky, Gad M. Landau, Shoshana Marcus, Dina Sokol:
Reconstructing Parameterized Strings from Parameterized Suffix and LCP Arrays. SPIRE 2022: 55-69 - [i19]Ora Amir, Amihood Amir, Aviezri Fraenkel, David Sarne:
On the Practical Power of Automata in Pattern Matching. CoRR abs/2207.08120 (2022) - 2021
- [j95]Amihood Amir, Eitan Kondratovsky:
Towards a real time algorithm for parameterized longest common prefix computation. Theor. Comput. Sci. 852: 132-137 (2021) - [c124]Amihood Amir, Itai Boneh, Eitan Kondratovsky:
The k-Mappability Problem Revisited. CPM 2021: 5:1-5:20 - [c123]Rami Cohen, Oren Sar Shalom, Dietmar Jannach, Amihood Amir:
A Black-Box Attack Model for Visually-Aware Recommender Systems. WSDM 2021: 94-102 - [i18]Amihood Amir, Itai Boneh, Eitan Kondratovsky:
The k-mappability problem revisited. CoRR abs/2106.07017 (2021) - [i17]Amihood Amir, Itai Boneh:
Dynamic Suffix Array with Sub-linear update time and Poly-logarithmic Lookup Time. CoRR abs/2112.12678 (2021) - 2020
- [j94]Amihood Amir, Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski:
Dynamic and Internal Longest Common Substring. Algorithmica 82(12): 3707-3743 (2020) - [j93]Amihood Amir, Avivit Levy, Ely Porat, B. Riva Shalom:
Online recognition of dictionary with one gap. Inf. Comput. 275: 104633 (2020) - [j92]Amihood Amir, Gad M. Landau, Shoshana Marcus, Dina Sokol:
Two-dimensional maximal repetitions. Theor. Comput. Sci. 812: 49-61 (2020) - [j91]Sung Gwan Park, Magsarjav Bataa, Amihood Amir, Gad M. Landau, Kunsoo Park:
Finding patterns and periods in Cartesian tree matching. Theor. Comput. Sci. 845: 181-197 (2020) - [c122]Amihood Amir, Ayelet Butman, Gad M. Landau, Shoshana Marcus, Dina Sokol:
Double String Tandem Repeats. CPM 2020: 3:1-3:13 - [c121]Amihood Amir, Itai Boneh, Michael Itzhaki, Eitan Kondratovsky:
Analysis of the Period Recovery Error Bound. ESA 2020: 5:1-5:21 - [c120]Amihood Amir, Itai Boneh:
Update Query Time Trade-Off for Dynamic Suffix Arrays. ISAAC 2020: 63:1-63:16 - [c119]Amihood Amir, Itai Boneh, Eitan Kondratovsky:
Approximating the Anticover of a String. SPIRE 2020: 99-114 - [c118]Amihood Amir, Ayelet Butman, Eitan Kondratovsky, Avivit Levy, Dina Sokol:
Multidimensional Period Recovery. SPIRE 2020: 115-130 - [c117]Ramtin Afshar, Amihood Amir, Michael T. Goodrich, Pedro Matias:
Adaptive Exact Learning in a Mixed-Up World: Dealing with Periodicity, Errors and Jumbled-Index Queries in String Reconstruction. SPIRE 2020: 155-174 - [i16]Amihood Amir, Itai Boneh:
Update Query Time Trade-off for dynamic Suffix Arrays. CoRR abs/2007.06604 (2020) - [i15]Ramtin Afshar, Amihood Amir, Michael T. Goodrich, Pedro Matias:
Adaptive Exact Learning in a Mixed-Up World: Dealing with Periodicity, Errors, and Jumbled-Index Queries in String Reconstruction. CoRR abs/2007.08787 (2020) - [i14]Rami Cohen, Oren Sar Shalom, Dietmar Jannach, Amihood Amir:
A Black-Box Attack Model for Visually-Aware Recommender Systems. CoRR abs/2011.02701 (2020)
2010 – 2019
- 2019
- [j90]Amihood Amir, Tsvi Kopelowitz, Avivit Levy, Seth Pettie, Ely Porat, B. Riva Shalom:
Mind the Gap! - Online Dictionary Matching with One Gap. Algorithmica 81(6): 2123-2157 (2019) - [j89]Amihood Amir, Avivit Levy, Moshe Lewenstein, Ronit Lubin, Benny Porat:
Can We Recover the Cover? Algorithmica 81(7): 2857-2875 (2019) - [j88]Amihood Amir, Avivit Levy, Ronit Lubin, Ely Porat:
Approximate cover of strings. Theor. Comput. Sci. 793: 59-69 (2019) - [c116]Amihood Amir, Eitan Kondratovsky:
Sufficient Conditions for Efficient Indexing Under Different Matchings. CPM 2019: 6:1-6:12 - [c115]Sung Gwan Park, Amihood Amir, Gad M. Landau, Kunsoo Park:
Cartesian Tree Matching and Indexing. CPM 2019: 16:1-16:14 - [c114]Amihood Amir, Itai Boneh, Panagiotis Charalampopoulos, Eitan Kondratovsky:
Repetition Detection in a Dynamic String. ESA 2019: 5:1-5:18 - [c113]Amihood Amir, Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski:
Longest Common Substring Made Fully Dynamic. ESA 2019: 6:1-6:17 - [c112]Magsarjav Bataa, Sung Gwan Park, Amihood Amir, Gad M. Landau, Kunsoo Park:
Finding Periods in Cartesian Tree Matching. IWOCA 2019: 70-84 - [i13]Sung Gwan Park, Amihood Amir, Gad M. Landau, Kunsoo Park:
Cartesian Tree Matching and Indexing. CoRR abs/1905.08974 (2019) - [i12]Amihood Amir, Itai Boneh:
Dynamic Palindrome Detection. CoRR abs/1906.09732 (2019) - 2018
- [j87]Xinrui Zhou, Amihood Amir, Concettina Guerra, Gad M. Landau, Jarek Rossignac:
EDoP Distance Between Sets of Incomplete Permutations: Application to Bacteria Classification Based on Gene Order. J. Comput. Biol. 25(11): 1193-1202 (2018) - [j86]Amihood Amir, Mika Amit, Gad M. Landau, Dina Sokol:
Period recovery of strings over the Hamming and edit distances. Theor. Comput. Sci. 710: 2-18 (2018) - [c111]Amihood Amir, Avivit Levy, Ely Porat:
Quasi-Periodicity Under Mismatch Errors. CPM 2018: 4:1-4:15 - [c110]Amihood Amir, Itai Boneh:
Locally Maximal Common Factors as a Tool for Efficient Dynamic String Algorithms. CPM 2018: 11:1-11:13 - [c109]Amihood Amir, Gad M. Landau, Shoshana Marcus, Dina Sokol:
Two-Dimensional Maximal Repetitions. ESA 2018: 2:1-2:14 - [c108]Oren Sar Shalom, Haggai Roitman, Amihood Amir, Alexandros Karatzoglou:
Collaborative Filtering Method for Handling Diverse and Repetitive User-Item Interactions. HT 2018: 43-51 - [c107]Amihood Amir, Eitan Kondratovsky:
Searching for a Modified Pattern in a Changing Text. SPIRE 2018: 241-253 - [i11]Amihood Amir, Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski:
Longest Common Factor Made Fully Dynamic. CoRR abs/1804.08731 (2018) - 2017
- [j85]Amihood Amir, Costas S. Iliopoulos, Jakub Radoszewski:
Two strings at Hamming distance 1 cannot be both quasiperiodic. Inf. Process. Lett. 128: 54-57 (2017) - [j84]Jinil Kim, Amihood Amir, Joong Chae Na, Kunsoo Park, Jeong Seop Sim:
On Representations of Ternary Order Relations in Numeric Strings. Math. Comput. Sci. 11(2): 127-136 (2017) - [j83]Amihood Amir, Alberto Apostolico, Travis Gagie, Gad M. Landau:
String cadences. Theor. Comput. Sci. 698: 4-8 (2017) - [c106]Amihood Amir, Avivit Levy, Moshe Lewenstein, Ronit Lubin, Benny Porat:
Can We Recover the Cover?. CPM 2017: 25:1-25:15 - [c105]Amihood Amir, Avivit Levy, Ronit Lubin, Ely Porat:
Approximate Cover of Strings. CPM 2017: 26:1-26:14 - [c104]Oren Sar Shalom, Haggai Roitman, Yishay Mansour, Amihood Amir:
A User Re-Modeling Approach to Item Recommendation using Complex Usage Data. ICTIR 2017: 201-208 - [c103]Amihood Amir, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis, Jakub Radoszewski:
Longest Common Factor After One Edit Operation. SPIRE 2017: 14-26 - [c102]Amihood Amir, Avivit Levy, Ely Porat, B. Riva Shalom:
Online Recognition of Dictionary with One Gap. Stringology 2017: 3-17 - [i10]Amihood Amir, Costas S. Iliopoulos, Jakub Radoszewski:
Two strings at Hamming distance 1 cannot be both quasiperiodic. CoRR abs/1703.00195 (2017) - 2016
- [j82]Amihood Amir, Haim Paryenty, Liam Roditty:
Configurations and Minority in the String Consensus Problem. Algorithmica 74(4): 1267-1292 (2016) - [j81]Amihood Amir, Alberto Apostolico, Tirza Hirst, Gad M. Landau, Noa Lewenstein, Liat Rozenberg:
Algorithms for Jumbled Indexing, Jumbled Border and Jumbled Square on run-length encoded strings. Theor. Comput. Sci. 656: 146-159 (2016) - [c101]Amihood Amir, Tsvi Kopelowitz, Avivit Levy, Seth Pettie, Ely Porat, B. Riva Shalom:
Mind the Gap: Essentially Optimal Algorithms for Online Dictionary Matching with One Gap. ISAAC 2016: 12:1-12:12 - [c100]Amihood Amir, Mika Amit, Gad M. Landau, Dina Sokol:
Period Recovery over the Hamming and Edit Distances. LATIN 2016: 55-67 - [c99]Amihood Amir, Oren Kapah, Tsvi Kopelowitz, Moni Naor, Ely Porat:
The Family Holiday Gathering Problem or Fair and Periodic Scheduling of Independent Sets. SPAA 2016: 367-375 - [r6]Amihood Amir:
Multidimensional Compressed Pattern Matching. Encyclopedia of Algorithms 2016: 1366-1369 - [r5]Jin Wook Kim, Amihood Amir, Gad M. Landau, Kunsoo Park:
Similarity Between Compressed Strings. Encyclopedia of Algorithms 2016: 1977-1981 - [r4]Amihood Amir:
Two-Dimensional Scaled Pattern Matching. Encyclopedia of Algorithms 2016: 2278-2282 - [i9]Amihood Amir, Alberto Apostolico, Travis Gagie, Gad M. Landau:
String Cadences. CoRR abs/1610.03337 (2016) - 2015
- [j80]Amihood Amir, Estrella Eisenberg, Avivit Levy:
Approximate periodicity. Inf. Comput. 241: 215-226 (2015) - [j79]Amihood Amir, Alberto Apostolico, Gad M. Landau, Ely Porat, Oren Sar Shalom:
A PTAS for the Square Tiling Problem. Theor. Comput. Sci. 562: 33-45 (2015) - [j78]Amihood Amir, Avivit Levy, Ely Porat, B. Riva Shalom:
Dictionary matching with a few gaps. Theor. Comput. Sci. 589: 34-46 (2015) - [c98]Amihood Amir, Benny Porat:
On the Hardness of Optimal Vertex Relabeling and Restricted Vertex Relabeling. CPM 2015: 1-12 - [c97]Oren Sar Shalom, Shlomo Berkovsky, Royi Ronen, Elad Ziklik, Amihood Amir:
Data Quality Matters in Recommender Systems. RecSys 2015: 257-260 - [c96]Amihood Amir, Moshe Lewenstein, Sharma V. Thankachan:
Range LCP Queries Revisited. SPIRE 2015: 350-361 - [i8]Amihood Amir, Tsvi Kopelowitz, Avivit Levy, Seth Pettie, Ely Porat, B. Riva Shalom:
Online Dictionary Matching with One Gap. CoRR abs/1503.07563 (2015) - 2014
- [j77]Amihood Amir, Alberto Apostolico, Gad M. Landau, Avivit Levy, Moshe Lewenstein, Ely Porat:
Range LCP. J. Comput. Syst. Sci. 80(7): 1245-1253 (2014) - [j76]Amihood Amir, Gianni Franceschini, Roberto Grossi, Tsvi Kopelowitz, Moshe Lewenstein, Noa Lewenstein:
Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to Online Indexing. SIAM J. Comput. 43(4): 1396-1416 (2014) - [j75]Amihood Amir, Alberto Apostolico, Estrella Eisenberg, Gad M. Landau, Avivit Levy, Noa Lewenstein:
Detecting approximate periodic patterns. Theor. Comput. Sci. 525: 60-67 (2014) - [j74]Amihood Amir, Estrella Eisenberg, Avivit Levy, Noa Lewenstein:
Closest periodic vectors in Lp spaces. Theor. Comput. Sci. 533: 26-36 (2014) - [c95]Amihood Amir, Moshe Lewenstein, Noa Lewenstein:
Hypertext Searching - A Survey. Language, Culture, Computation (1) 2014: 364-381 - [c94]Amihood Amir, Jessica Ficler, Liam Roditty, Oren Sar Shalom:
On the Efficiency of the Hamming C-Centerstring Problems. CPM 2014: 1-10 - [c93]Amihood Amir, Avivit Levy, Ely Porat, B. Riva Shalom:
Dictionary Matching with One Gap. CPM 2014: 11-20 - [c92]Amihood Amir, Benny Porat:
Approximate On-line Palindrome Recognition, and Applications. CPM 2014: 21-29 - [c91]Jinil Kim, Amihood Amir, Joong Chae Na, Kunsoo Park, Jeong Seop Sim:
On Representations of Ternary Order Relations in Numeric Strings. ICABD 2014: 46-52 - [c90]Amihood Amir, Timothy M. Chan, Moshe Lewenstein, Noa Lewenstein:
On Hardness of Jumbled Indexing. ICALP (1) 2014: 114-125 - [c89]Amihood Amir, Jessica Ficler, Robert Krauthgamer, Liam Roditty, Oren Sar Shalom:
Multiply Balanced k -Partitioning. LATIN 2014: 586-597 - [c88]Amihood Amir, Alberto Apostolico, Tirza Hirst, Gad M. Landau, Noa Lewenstein, Liat Rozenberg:
Algorithms for Jumbled Indexing, Jumbled Border and Jumbled Square on Run-Length Encoded Strings. SPIRE 2014: 45-51 - [i7]Amihood Amir, Timothy M. Chan, Moshe Lewenstein, Noa Lewenstein:
On Hardness of Jumbled Indexing. CoRR abs/1405.0189 (2014) - [i6]Amihood Amir, Oren Kapah, Tsvi Kopelowitz, Moni Naor, Ely Porat:
The Family Holiday Gathering Problem or Fair and Periodic Scheduling of Independent Sets. CoRR abs/1408.2279 (2014) - [i5]Amihood Amir, Avivit Levy, Ely Porat, B. Riva Shalom:
Dictionary Matching with One Gap. CoRR abs/1408.2350 (2014) - [i4]Amihood Amir, Oren Kapah, Ely Porat, Amir Rothschild:
Polynomials: a new tool for length reduction in binary discrete convolutions. CoRR abs/1410.5607 (2014) - 2013
- [j73]Amihood Amir, Haim Paryenty, Liam Roditty:
On the hardness of the Consensus String problem. Inf. Process. Lett. 113(10-11): 371-374 (2013) - [c87]Amihood Amir, Benny Porat:
Pattern Matching with Non Overlapping Reversals - Approximation and On-line Algorithms. ISAAC 2013: 55-65 - [i3]Amihood Amir, Gianni Franceschini, Roberto Grossi, Tsvi Kopelowitz, Moshe Lewenstein, Noa Lewenstein:
Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to On-Line Indexing. CoRR abs/1306.0406 (2013) - 2012
- [j72]Amihood Amir, Laxmi Parida:
Combinatorial Pattern Matching (CPM 2010). Inf. Comput. 213: 1 (2012) - [j71]Amihood Amir, Haim Parienty:
Towards a theory of patches. J. Discrete Algorithms 12: 61-73 (2012) - [j70]Amihood Amir, Estrella Eisenberg, Avivit Levy, Ely Porat, Natalie Shapira:
Cycle detection and correction. ACM Trans. Algorithms 9(1): 13:1-13:20 (2012) - [j69]Amihood Amir, Yonatan Aumann, Avivit Levy, Yuri Roshko:
Quasi-distinct parsing and optimal compression methods. Theor. Comput. Sci. 422: 1-14 (2012) - [c86]Amihood Amir, Alberto Apostolico, Estrella Eisenberg, Gad M. Landau, Avivit Levy, Noa Lewenstein:
Detecting Approximate Periodic Patterns. MedAlg 2012: 1-12 - [c85]Amihood Amir, Avivit Levy:
Approximate Period Detection and Correction. SPIRE 2012: 1-15 - [c84]Amihood Amir, Haim Paryenty, Liam Roditty:
Configurations and Minority in the String Consensus Problem. SPIRE 2012: 42-53 - 2011
- [j68]Amihood Amir, Estrella Eisenberg, Orgad Keller, Avivit Levy, Ely Porat:
Approximate string matching with stuck address bits. Theor. Comput. Sci. 412(29): 3537-3544 (2011) - [j67]Amihood Amir, Gad M. Landau, Joong Chae Na, Heejin Park, Kunsoo Park, Jeong Seop Sim:
Efficient algorithms for consensus string problems minimizing both distance sum and radius. Theor. Comput. Sci. 412(39): 5239-5246 (2011) - [c83]Amihood Amir, Alberto Apostolico, Gad M. Landau, Avivit Levy, Moshe Lewenstein, Ely Porat:
Range LCP. ISAAC 2011: 683-692 - [c82]Amihood Amir, Estrella Eisenberg, Avivit Levy, Noa Lewenstein:
Closest Periodic Vectors in L p Spaces. ISAAC 2011: 714-723 - [c81]Julio Ng, Amihood Amir, Pavel A. Pevzner:
Blocked Pattern Matching Problem and Its Applications in Proteomics. RECOMB 2011: 298-319 - [c80]Amihood Amir, Zvi Gotthilf, B. Riva Shalom:
Weighted Shortest Common Supersequence. SPIRE 2011: 44-54 - [c79]Amihood Amir, Haim Parienty, Liam Roditty:
Approximations and Partial Solutions for the Consensus Sequence Problem. SPIRE 2011: 168-173 - 2010
- [j66]Amihood Amir, Eran Chencinski:
Faster Two Dimensional Scaled Matching. Algorithmica 56(2): 214-234 (2010) - [j65]Amihood Amir, Zvi Gotthilf, B. Riva Shalom:
Weighted LCS. J. Discrete Algorithms 8(3): 273-281 (2010) - [c78]Amihood Amir, Avivit Levy:
String Rearrangement Metrics: A Survey. Algorithms and Applications 2010: 1-33 - [c77]Amihood Amir, Estrella Eisenberg, Avivit Levy, Ely Porat, Natalie Shapira:
Cycle Detection and Correction. ICALP (1) 2010: 43-54 - [c76]Amihood Amir, Estrella Eisenberg, Avivit Levy:
Approximate Periodicity. ISAAC (1) 2010: 25-36 - [c75]Amihood Amir, Alberto Apostolico, Gad M. Landau, Oren Sar Shalom:
A PTAS for the Square Tiling Problem. SPIRE 2010: 118-126 - [c74]Amihood Amir, Estrella Eisenberg, Orgad Keller, Avivit Levy, Ely Porat:
Approximate String Matching with Stuck Address Bits. SPIRE 2010: 395-405 - [e3]Amihood Amir, Laxmi Parida:
Combinatorial Pattern Matching, 21st Annual Symposium, CPM 2010, New York, NY, USA, June 21-23, 2010. Proceedings. Lecture Notes in Computer Science 6129, Springer 2010, ISBN 978-3-642-13508-8 [contents]
2000 – 2009
- 2009
- [j64]Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat:
Real Two Dimensional Scaled Matching. Algorithmica 53(3): 314-336 (2009) - [j63]Amihood Amir, Gonzalo Navarro:
Parameterized matching on non-linear structures. Inf. Process. Lett. 109(15): 864-867 (2009) - [j62]Amihood Amir, Yonatan Aumann, Gary Benson, Avivit Levy, Ohad Lipsky, Ely Porat, Steven Skiena, Uzi Vishne:
Pattern matching with address errors: Rearrangement distances. J. Comput. Syst. Sci. 75(6): 359-370 (2009) - [j61]Amihood Amir, Tzvika Hartman, Oren Kapah, Avivit Levy, Ely Porat:
On the Cost of Interchange Rearrangement in Strings. SIAM J. Comput. 39(4): 1444-1461 (2009) - [j60]Amihood Amir, Yonatan Aumann, Piotr Indyk, Avivit Levy, Ely Porat:
Efficient computations of l1 and l∞ rearrangement distances. Theor. Comput. Sci. 410(43): 4382-4390 (2009) - [j59]Amihood Amir, Yonatan Aumann, Oren Kapah, Avivit Levy, Ely Porat:
Approximate string matching with address bit errors. Theor. Comput. Sci. 410(51): 5334-5346 (2009) - [c73]Amihood Amir, Yonatan Aumann, Avivit Levy, Yuri Roshko:
Quasi-distinct Parsing and Optimal Compression Methods. CPM 2009: 12-25 - [c72]Amihood Amir, Zvi Gotthilf, B. Riva Shalom:
Weighted LCS. IWOCA 2009: 36-47 - [c71]Amihood Amir, Gad M. Landau, Joong Chae Na, Heejin Park, Kunsoo Park, Jeong Seop Sim:
Consensus Optimizing Both Distance Sum and Radius. SPIRE 2009: 234-242 - [c70]Amihood Amir, Haim Parienty:
Towards a Theory of Patches. SPIRE 2009: 254-265 - 2008
- [j58]Amihood Amir, Avivit Levy, Liron Reuveni:
The Practical Efficiency of Convolutions in Pattern Matching Algorithms. Fundam. Informaticae 84(1): 1-15 (2008) - [j57]Jin Wook Kim, Amihood Amir, Gad M. Landau, Kunsoo Park:
Computing similarity of run-length encoded strings with affine gap penalty. Theor. Comput. Sci. 395(2-3): 268-282 (2008) - [j56]Amihood Amir, Eran Chencinski, Costas S. Iliopoulos, Tsvi Kopelowitz, Hui Zhang:
Property matching and weighted matching. Theor. Comput. Sci. 395(2-3): 298-310 (2008) - [j55]Amihood Amir, Tzvika Hartman, Oren Kapah, B. Riva Shalom, Dekel Tsur:
Generalized LCS. Theor. Comput. Sci. 409(3): 438-449 (2008) - [c69]Amihood Amir, Yonatan Aumann, Oren Kapah, Avivit Levy, Ely Porat:
Approximate String Matching with Address Bit Errors. CPM 2008: 118-129 - [c68]Amihood Amir, Igor Nor:
Real-time indexing over fixed finite alphabets. SODA 2008: 1086-1095 - [e2]Amihood Amir, Andrew Turpin, Alistair Moffat:
String Processing and Information Retrieval, 15th International Symposium, SPIRE 2008, Melbourne, Australia, November 10-12, 2008. Proceedings. Lecture Notes in Computer Science 5280, Springer 2008, ISBN 978-3-540-89096-6 [contents] - [r3]Amihood Amir:
Multidimensional Compressed Pattern Matching. Encyclopedia of Algorithms 2008 - [r2]Amihood Amir:
Two-Dimensional Scaled Pattern Matching. Encyclopedia of Algorithms 2008 - [r1]Jin Wook Kim, Amihood Amir, Gad M. Landau, Kunsoo Park:
Similarity between Compressed Strings. Encyclopedia of Algorithms 2008 - [i2]Amihood Amir, Klim Efremenko, Oren Kapah, Ely Porat, Amir Rothschild:
Improved Deterministic Length Reduction. CoRR abs/0802.0017 (2008) - 2007
- [j54]Amihood Amir, Leszek Gasieniec, B. Riva Shalom:
Improved approximate common interval. Inf. Process. Lett. 103(4): 142-149 (2007) - [j53]Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat, Dekel Tsur:
Efficient one-dimensional real scaled matching. J. Discrete Algorithms 5(2): 205-211 (2007) - [j52]Amihood Amir, Igor Nor:
Generalized function matching. J. Discrete Algorithms 5(3): 514-523 (2007) - [j51]Amihood Amir, Gad M. Landau, Moshe Lewenstein, Dina Sokol:
Dynamic text and static pattern matching. ACM Trans. Algorithms 3(2): 19 (2007) - [c67]Amihood Amir, Oren Kapah, Ely Porat:
Deterministic Length Reduction: Fast Convolution in Sparse Data and Applications. CPM 2007: 183-194 - [c66]Amihood Amir, Johannes Fischer, Moshe Lewenstein:
Two-Dimensional Range Minimum Queries. CPM 2007: 286-294 - [c65]Amihood Amir, Tzvika Hartman, Oren Kapah, Avivit Levy, Ely Porat:
On the Cost of Interchange Rearrangement in Strings. ESA 2007: 99-110 - [c64]Amihood Amir, Yonatan Aumann, Piotr Indyk, Avivit Levy, Ely Porat:
Efficient Computations of l1 and linfinity Rearrangement Distances. SPIRE 2007: 39-49 - [c63]Amihood Amir, Tzvika Hartman, Oren Kapah, B. Riva Shalom, Dekel Tsur:
Generalized LCS. SPIRE 2007: 50-61 - 2006
- [j50]Amihood Amir, Estrella Eisenberg, Ely Porat:
Swap and Mismatch Edit Distance. Algorithmica 45(1): 109-120 (2006) - [j49]Amihood Amir, Yonatan Aumann, Moshe Lewenstein, Ely Porat:
Function Matching. SIAM J. Comput. 35(5): 1007-1022 (2006) - [j48]Amihood Amir, Oren Kapah, Dekel Tsur:
Faster two-dimensional pattern matching with rotations. Theor. Comput. Sci. 368(3): 196-204 (2006) - [c62]Amihood Amir:
Asynchronous Pattern Matching. CPM 2006: 1-10 - [c61]Amihood Amir, Eran Chencinski, Costas S. Iliopoulos, Tsvi Kopelowitz, Hui Zhang:
Property Matching and Weighted Matching. CPM 2006: 188-199 - [c60]Amihood Amir, Eran Chencinski:
Faster Two Dimensional Scaled Matching. CPM 2006: 200-210 - [c59]Amihood Amir, Costas S. Iliopoulos, Oren Kapah, Ely Porat:
Approximate Matching in Weighted Sequences. CPM 2006: 365-376 - [c58]Amihood Amir, Yonatan Aumann, Gary Benson, Avivit Levy, Ohad Lipsky, Ely Porat, Steven Skiena, Uzi Vishne:
Pattern matching with address errors: rearrangement distances. SODA 2006: 1221-1229 - 2005
- [j47]Amihood Amir, Gad M. Landau:
Foreword. Discret. Appl. Math. 146(2): 123 (2005) - [j46]Amihood Amir:
Theoretical issues of searching aerial photographs: a bird's eye view. Int. J. Found. Comput. Sci. 16(6): 1075-1097 (2005) - [j45]Amihood Amir, Yonatan Aumann, Ronen Feldman, Moshe Fresko:
Maximal Association Rules: A Tool for Mining Associations in Text. J. Intell. Inf. Syst. 25(3): 333-345 (2005) - [c57]Amihood Amir:
Two Glass Balls and a Tower. We Will Show Them! (1) 2005: 57-76 - [c56]Amihood Amir, Ohad Lipsky, Ely Porat, Julia Umanski:
Approximate Matching in the L1 Metric. CPM 2005: 91-103 - [c55]Hagai Aronowitz, David Burshtein, Amihood Amir:
A Session-GMM Generative Model Using Test Utterance Gaussian Mixture Modeling for Speaker Verification. ICASSP (1) 2005: 733-736 - [c54]Amihood Amir, Tsvi Kopelowitz, Moshe Lewenstein, Noa Lewenstein:
Towards Real-Time Suffix Tree Construction. SPIRE 2005: 67-78 - [c53]Jin Wook Kim, Amihood Amir, Gad M. Landau, Kunsoo Park:
Computing Similarity of Run-Length Encoded Strings with Affine Gap Penalty. SPIRE 2005: 315-326 - [c52]Amihood Amir:
Asynchronous pattern matching - Metrics. Stringology 2005: 31-36 - 2004
- [j44]Amihood Amir, Kenneth Ward Church, Emanuel Dar:
The submatrices character count problem: an efficient solution using separable values. Inf. Comput. 190(1): 100-116 (2004) - [j43]Amihood Amir, Moshe Lewenstein, Ely Porat:
Faster algorithms for string matching with k mismatches. J. Algorithms 50(2): 257-275 (2004) - [j42]Amihood Amir, Ayelet Butman, Maxime Crochemore, Gad M. Landau, Malka Schaps:
Two-dimensional pattern matching with rotations. Theor. Comput. Sci. 314(1-2): 173-187 (2004) - [c51]Shlomo Argamon, Navot Akiva, Amihood Amir, Oren Kapah:
Efficient Unsupervised Recursive Word Segmentation Using Minimum Description Length. COLING 2004 - [c50]Amihood Amir, Oren Kapah, Dekel Tsur:
Faster Two Dimensional Pattern Matching with Rotations. CPM 2004: 409-419 - [c49]Amihood Amir, Estrella Eisenberg, Ely Porat:
Swap and Mismatch Edit Distance. ESA 2004: 16-27 - [c48]Hagai Aronowitz, David Burshtein, Amihood Amir:
Speaker indexing in audio archives using test utterance Gaussian mixture modeling. INTERSPEECH 2004: 609-612 - [c47]Hagai Aronowitz, David Burshtein, Amihood Amir:
Text independent speaker recognition using speaker dependent word spotting. INTERSPEECH 2004: 1789-1792 - [c46]Amihood Amir, Igor Nor:
Generalized Function Matching. ISAAC 2004: 41-52 - [c45]Hagai Aronowitz, David Burshtein, Amihood Amir:
Speaker Indexing in Audio Archives Using Gaussian Mixture Scoring Simulation. MLMI 2004: 243-252 - [c44]Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat, Dekel Tsur:
Efficient One Dimensional Real Scaled Matching. SPIRE 2004: 1-9 - [c43]Amihood Amir:
Theoretical Issues of Searching Aerial Photographs: A Bird's Eye View. Stringology 2004: 1-23 - [c42]Amihood Amir, Reuven Kashi, Daniel A. Keim, Nathan S. Netanyahu, Markus Wawryniuk:
Shape-Embedded-Histograms for Visual Data Mining. VisSym 2004: 55-64, 341 - 2003
- [j41]Amihood Amir, Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat:
Overlap matching. Inf. Comput. 181(1): 57-74 (2003) - [j40]Amihood Amir, Richard Beigel, William I. Gasarch:
Some connections between bounded query classes and non-uniform complexity. Inf. Comput. 186(1): 104-139 (2003) - [j39]Amihood Amir, Gad M. Landau, Dina Sokol:
Inplace 2D matching in compressed images. J. Algorithms 49(2): 240-261 (2003) - [j38]Amihood Amir, Alberto Apostolico, Gad M. Landau, Giorgio Satta:
Efficient text fingerprinting via Parikh mapping. J. Discrete Algorithms 1(5-6): 409-421 (2003) - [j37]Amihood Amir, Gad M. Landau, Dina Sokol:
Inplace run-length 2d compressed search. Theor. Comput. Sci. 290(3): 1361-1383 (2003) - [c41]Amihood Amir, Ayelet Butman, Maxime Crochemore, Gad M. Landau, Malka Schaps:
Two-Dimensional Pattern Matching with Rotations. CPM 2003: 17-31 - [c40]Yair Horesh, Amihood Amir, Shulamit Michaeli, Ron Unger:
A rapid method for detection of putative RNAi target genes in genomic data. ECCB 2003: 73-80 - [c39]Amihood Amir, Yonatan Aumann, Richard Cole, Moshe Lewenstein, Ely Porat:
Function Matching: Algorithms, Applications, and a Lower Bound. ICALP 2003: 929-942 - [c38]Amihood Amir, Reuven Kashi, Nathan S. Netanyahu:
Efficient Multidimensional Quantitative Hypotheses Generation. ICDM 2003: 3-10 - [c37]Amihood Amir, Reuven Kashi, Nathan S. Netanyahu, Daniel A. Keim, Markus Wawryniuk:
Analyzing High-Dimensional Data by Subspace Validity. ICDM 2003: 473-476 - [c36]Amihood Amir, Gad M. Landau, Dina Sokol:
Inplace 2D matching in compressed images. SODA 2003: 853-862 - [c35]Amihood Amir, Gad M. Landau, Moshe Lewenstein, Dina Sokol:
Dynamic Text and Static Pattern Matching. WADS 2003: 340-352 - [c34]Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat:
Real Two Dimensional Scaled Matching. WADS 2003: 353-364 - 2002
- [j36]Amihood Amir, Gad M. Landau, Esko Ukkonen:
Online timestamped text indexing. Inf. Process. Lett. 82(5): 253-259 (2002) - [j35]Amihood Amir, Moshe Lewenstein, Ely Porat:
Approximate swapped matching. Inf. Process. Lett. 83(1): 33-39 (2002) - [c33]Amihood Amir, Kenneth Ward Church, Emanuel Dar:
Separable attributes: a technique for solving the sub matrices character count problem. SODA 2002: 400-401 - 2001
- [j34]Jacqueline Yadgari, Amihood Amir, Ron Unger:
Genetic Threading. Constraints An Int. J. 6(2/3): 271-292 (2001) - [c32]Amihood Amir, Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat:
Overlap matching. SODA 2001: 279-288 - [c31]Amihood Amir, Ely Porat, Moshe Lewenstein:
Approximate subset matching with Don't Cares. SODA 2001: 305-306 - [c30]Amihood Amir, Reuven Kashi, Nathan S. Netanyahu:
Analyzing Quantitative Databases: Image is Everything. VLDB 2001: 89-98 - [e1]Amihood Amir, Gad M. Landau:
Combinatorial Pattern Matching, 12th Annual Symposium, CPM 2001 Jerusalem, Israel, July 1-4, 2001 Proceedings. Lecture Notes in Computer Science 2089, Springer 2001, ISBN 3-540-42271-4 [contents] - 2000
- [j33]Amihood Amir, Moshe Lewenstein, Noa Lewenstein:
Pattern Matching in Hypertext. J. Algorithms 35(1): 82-99 (2000) - [j32]Amihood Amir, Gruia Calinescu:
Alphabet-Independent and Scaled Dictionary Matching. J. Algorithms 36(1): 34-62 (2000) - [j31]Amihood Amir, Yonatan Aumann, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein:
Pattern Matching with Swaps. J. Algorithms 37(2): 247-266 (2000) - [j30]Amihood Amir, Dmitry Keselman, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein, Michael Rodeh:
Text Indexing and Dictionary Matching with One Error. J. Algorithms 37(2): 309-325 (2000) - [j29]Gilad Koren, Emanuel Dar, Amihood Amir:
The Power of Migration in Multiprocessor Scheduling of Real-Time Systems. SIAM J. Comput. 30(2): 511-527 (2000) - [c29]Amihood Amir, Moshe Lewenstein, Ely Porat:
Approximate Swapped Matching. FSTTCS 2000: 302-311 - [c28]Amihood Amir, Moshe Lewenstein, Ely Porat:
Faster algorithms for string matching with k mismatches. SODA 2000: 794-803 - [c27]Amihood Amir, Ayelet Butman, Moshe Lewenstein:
Real scaled matching. SODA 2000: 815-816 - [c26]Amihood Amir, Gad M. Landau, Dina Sokol:
Inplace run-length 2d compressed search. SODA 2000: 817-818 - [i1]Amihood Amir, Richard Beigel, William I. Gasarch:
Some Connections between Bounded Query Classes and Non-Uniform Complexity. Electron. Colloquium Comput. Complex. TR00 (2000)
1990 – 1999
- 1999
- [j28]S. Uliel, A. Fliess, Amihood Amir, Ron Unger:
A simple algorithm for detecting circular permutations in proteins. Bioinform. 15(11): 930-936 (1999) - [j27]Amihood Amir, Ayelet Butman, Moshe Lewenstein:
Real Scaled Matching. Inf. Process. Lett. 70(4): 185-190 (1999) - [c25]Amihood Amir, Dmitry Keselman, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein, Michael Rodeh:
Indexing and Dictionary Matching with One Error. WADS 1999: 181-192 - 1998
- [j26]Amihood Amir, Gary Benson, Martin Farach:
Optimal Parallel Two Dimensional Text Searching on a CREW PRAM. Inf. Comput. 144(1): 1-17 (1998) - [j25]Amihood Amir, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein:
Efficient Special Cases of Pattern Matching with Swaps. Inf. Process. Lett. 68(3): 125-132 (1998) - [j24]Amihood Amir, Gary Benson:
Two-Dimensional Periodicity in Rectangular Arrays. SIAM J. Comput. 27(1): 90-106 (1998) - [c24]Amihood Amir, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein:
Efficient Special Cases of Pattern Matching with Swaps. CPM 1998: 209-220 - [c23]Jacqueline Yadgari, Amihood Amir, Ron Unger:
Genetic Algorithms for Protein Threading. ISMB 1998: 193-202 - [c22]Gilad Koren, Amihood Amir, Emanuel Dar:
The Power of Migration in Multi-Processor Scheduling of Real-Time Systems. SODA 1998: 226-235 - 1997
- [j23]Amihood Amir, Emanuel Dar:
An Improved Deterministic Algorithm for Generating Different Many-Element Random Samples. Inf. Process. Lett. 62(2): 95-101 (1997) - [j22]Amihood Amir, Ronen Feldman, Reuven Kashi:
A New and Versatile Method for Association Generation. Inf. Syst. 22(6/7): 333-347 (1997) - [j21]Amihood Amir, Alberto Apostolico, Moshe Lewenstein:
Inverse Pattern Matching. J. Algorithms 24(2): 325-339 (1997) - [j20]Amihood Amir, Gary Benson, Martin Farach:
Optimal Two-Dimensional Compressed Matching. J. Algorithms 24(2): 354-379 (1997) - [j19]Amihood Amir, Dmitry Keselman:
Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms. SIAM J. Comput. 26(6): 1656-1669 (1997) - [c21]Amihood Amir, Emanuel Dar:
An Improved Deterministic Algorithms for Generalized Random Sampling. CIAC 1997: 159-170 - [c20]Ronen Feldman, Yonatan Aumann, Amihood Amir, Heikki Mannila:
Efficient Algorithms for Discovering Frequent Sets in Incremental Databases. DMKD 1997 - [c19]Amihood Amir, Yonatan Aumann, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein:
Pattern Matching with Swaps. FOCS 1997: 144-153 - [c18]Ronen Feldman, Yonatan Aumann, Amihood Amir, Amir Zilberstein, Willi Klösgen:
Maximal Association Rules: A New Tool for Mining for Keyword Co-Occurrences in Document Collections. KDD 1997: 167-170 - [c17]Amihood Amir, Ronen Feldman, Reuven Kashi:
A New and Versatile Method for Association Generation. PKDD 1997: 221-231 - [c16]Amihood Amir, Moshe Lewenstein, Noa Lewenstein:
Pattern Matching In Hypertext. WADS 1997: 160-173 - [p1]Amihood Amir, Martin Farach:
Two dimensional matching. Pattern Matching Algorithms 1997: 267-292 - 1996
- [j18]Amihood Amir, Gary Benson, Martin Farach:
Let Sleeping Files Lie: Pattern Matching in Z-Compressed Files. J. Comput. Syst. Sci. 52(2): 299-307 (1996) - [c15]Amihood Amir, Gruia Calinescu:
Alphabet Independent and Dictionary Scaled Matching. CPM 1996: 320-334 - 1995
- [j17]Amihood Amir, Martin Farach:
Efficient 2-Dimensional Approximate Matching of Half-Rectangular Figures. Inf. Comput. 118(1): 1-11 (1995) - [j16]Amihood Amir, Martin Farach, Ramana M. Idury, Johannes A. La Poutré, Alejandro A. Schäffer:
Improved Dynamic Dictionary Matching. Inf. Comput. 119(2): 258-282 (1995) - [j15]Amihood Amir, Manuel Blum, Michael C. Loui, John E. Savage, Carl Smith:
Contributions of theoretical computer science. SIGACT News 26(4): 2-4 (1995) - 1994
- [j14]Amihood Amir, Martin Farach, S. Muthukrishnan:
Alphabet Dependence in Parameterized Matching. Inf. Process. Lett. 49(3): 111-115 (1994) - [j13]Amihood Amir, Martin Farach, Zvi Galil, Raffaele Giancarlo, Kunsoo Park:
Dynamic Dictionary Matching. J. Comput. Syst. Sci. 49(2): 208-222 (1994) - [j12]Amihood Amir, Gary Benson, Martin Farach:
An Alphabet Independent Approach to Two-Dimensional Pattern Matching. SIAM J. Comput. 23(2): 313-323 (1994) - [c14]Dmitry Keselman, Amihood Amir:
Maximum Agreement Subtree in a Set of Evolutionary Trees-Metrics and Efficient Algorithms. FOCS 1994: 758-769 - [c13]Amihood Amir, Gary Benson, Martin Farach:
Optimal Two-Dimensional Compressed Matching. ICALP 1994: 215-226 - [c12]Amihood Amir, Gary Benson, Martin Farach:
Let Sleeping Files Lie: Pattern Matching in Z-compressed Files. SODA 1994: 705-714 - 1993
- [j11]Amihood Amir, Carl H. Smith:
The Syntax of Parallelism. Fundam. Informaticae 19(3/4): 383-402 (1993) - [c11]Amihood Amir, Martin Farach, Ramana M. Idury, Johannes A. La Poutré, Alejandro A. Schäffer:
Improved Dynamic Dictionary Matching. SODA 1993: 392-401 - [c10]Amihood Amir, Gary Benson, Martin Farach:
Optimal Parallel Two Dimensional Pattern Matching. SPAA 1993: 79-85 - 1992
- [j10]Amihood Amir, Martin Farach:
Two-Dimensional Dictionary Matching. Inf. Process. Lett. 44(5): 233-239 (1992) - [j9]Amihood Amir, Gad M. Landau, Uzi Vishkin:
Efficient Pattern Matching with Scaling. J. Algorithms 13(1): 2-32 (1992) - [c9]Amihood Amir, Martin Farach, Yossi Matias:
Efficient Randomized Dictionary Matching Algorithms (Extended Abstract). CPM 1992: 262-275 - [c8]Amihood Amir, Gary Benson:
Efficient Two-Dimensional Compressed Matching. Data Compression Conference 1992: 279-288 - [c7]Amihood Amir, Gary Benson:
Two-Dimensional Periodicity and Its Applications. SODA 1992: 440-452 - [c6]Amihood Amir, Gary Benson, Martin Farach:
Alphabet Independent Two Dimensional Matching. STOC 1992: 59-68 - 1991
- [j8]Amihood Amir, Martin Farach:
Efficient matching of nonrectangular shapes. Ann. Math. Artif. Intell. 4: 211-224 (1991) - [j7]Amihood Amir, Doron Mintz:
An efficient algorithm for generalized random sampling. Pattern Recognit. Lett. 12(11): 683-686 (1991) - [j6]Amihood Amir, Gad M. Landau:
Fast Parallel and Serial Multidimensional Aproximate Array Matching. Theor. Comput. Sci. 81(1): 97-115 (1991) - [c5]Amihood Amir, Martin Farach:
Adaptive Dictionary Matching. FOCS 1991: 760-766 - [c4]Amihood Amir, Martin Farach:
Efficient 2-dimensional Approximate Matching of Non-Rectangular Figures. SODA 1991: 212-223 - 1990
- [j5]Amihood Amir, Nick Roussopoulos:
Optimal view caching. Inf. Syst. 15(2): 169-171 (1990) - [c3]Amihood Amir, Richard Beigel, William I. Gasarch:
Some Connections Between Bounded Query Classes and Non-Uniform Complexity. SCT 1990: 232-243 - [c2]Amihood Amir, Gad M. Landau, Uzi Vishkin:
Efficient Pattern Matching with Scaling. SODA 1990: 344-357
1980 – 1989
- 1988
- [j4]Amihood Amir, William I. Gasarch:
Polynomial Terse Sets. Inf. Comput. 77(1): 37-56 (1988) - 1987
- [j3]Amihood Amir, Dov M. Gabbay:
Preservation of Expressive Completeness in Temporal Models. Inf. Comput. 72(1): 66-83 (1987) - [j2]Amihood Amir:
Expressive Completeness Failure in Branching Time Structures. J. Comput. Syst. Sci. 34(1): 27-42 (1987) - [c1]Amihood Amir, William I. Gasarch:
Polynomial terse sets. SCT 1987: 22-27 - 1985
- [j1]Amihood Amir:
Separation in Nonlinear Time Models. Inf. Control. 66(3): 177-203 (1985)
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 2024-10-07 21:23 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
