default search action
Moran Feldman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j33]Moran Feldman
, Ariel Szarf:
Maximum Matching Sans Maximal Matching: A New Approach for Finding Maximum Matchings in the Data Stream Model. Algorithmica 86(4): 1173-1209 (2024) - [c60]Loay Raed Mualem, Ethan R. Elenberg, Moran Feldman, Amin Karbasi:
Submodular Minimax Optimization: Finding Effective Sets. AISTATS 2024: 1081-1089 - [c59]Niv Buchbinder, Moran Feldman:
Deterministic Algorithm and Faster Algorithm for Submodular Maximization Subject to a Matroid Constraint. FOCS 2024: 700-712 - [c58]Loay Mualem, Murad Tukan, Moran Feldman:
Bridging the Gap between General and Down-Closed Convex Sets in Submodular Maximization. IJCAI 2024: 1926-1934 - [c57]Niv Buchbinder
Constrained Submodular Maximization via New Bounds for DR-Submodular Functions. STOC 2024: 1820-1831 - [i50]Loay Mualem, Murad Tukan, Moran Feldman:
Bridging the Gap Between General and Down-Closed Convex Sets in Submodular Maximization. CoRR abs/2401.09251 (2024) - [i49]Murad Tukan, Loay Mualem, Moran Feldman:
Practical 0.385-Approximation for Submodular Maximization Subject to a Cardinality Constraint. CoRR abs/2405.13994 (2024) - [i48]Niv Buchbinder, Moran Feldman:
Deterministic Algorithm and Faster Algorithm for Submodular Maximization subject to a Matroid Constraint. CoRR abs/2408.03583 (2024) - [i47]Niv Buchbinder, Moran Feldman:
Extending the Extension: Deterministic Algorithm for Non-monotone Submodular Maximization. CoRR abs/2409.14325 (2024) - 2023
- [j32]Moran Feldman
Practical Budgeted Submodular Maximization. Algorithmica 85(5): 1332-1371 (2023) - [j31]Moran Feldman
The One-Way Communication Complexity of Submodular Maximization with Applications to Streaming and Robustness. J. ACM 70(4): 24:1-24:52 (2023) - [j30]Moran Feldman, Christopher Harshaw, Amin Karbasi:
How Do You Want Your Greedy: Simultaneous or Repeated? J. Mach. Learn. Res. 24: 72:1-72:87 (2023) - [j29]Niv Buchbinder
Deterministic (1/2 + ε)-Approximation for Submodular Maximization over a Matroid. SIAM J. Comput. 52(4): 945-967 (2023) - [c56]Loay Mualem, Moran Feldman:
Resolving the Approximability of Offline and Online Non-monotone DR-Submodular Maximization over General Convex Sets. AISTATS 2023: 2542-2564 - [i46]Loay Mualem, Ethan R. Elenberg, Moran Feldman, Amin Karbasi:
Submodular Minimax Optimization: Finding Effective Sets. CoRR abs/2305.16903 (2023) - [i45]Niv Buchbinder, Moran Feldman:
Constrained Submodular Maximization via New Bounds for DR-Submodular Functions. CoRR abs/2311.01129 (2023) - 2022
- [j28]Moran Feldman:
Correction to: Guess Free Maximization of Submodular and Linear Sums. Algorithmica 84(10): 3101-3102 (2022) - [j27]Christopher Harshaw
The Power of Subsampling in Submodular Maximization. Math. Oper. Res. 47(2): 1365-1393 (2022) - [j26]Naor Alaluf, Alina Ene
An Optimal Streaming Algorithm for Submodular Maximization with a Cardinality Constraint. Math. Oper. Res. 47(4): 2667-2690 (2022) - [j25]Moran Feldman
A Framework for the Secretary Problem on the Intersection of Matroids. SIAM J. Comput. 51(3): 766-819 (2022) - [c55]Moran Feldman
Maximum Matching Sans Maximal Matching: A New Approach for Finding Maximum Matchings in the Data Stream Model. APPROX/RANDOM 2022: 33:1-33:24 - [c54]Kobi Bodek, Moran Feldman:
Maximizing Sums of Non-Monotone Submodular and Linear Functions: Understanding the Unconstrained Case. ESA 2022: 23:1-23:17 - [c53]Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen:
Submodular Maximization Subject to Matroid Intersection on the Fly. ESA 2022: 52:1-52:14 - [c52]Moran Feldman, Paul Liu, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen:
Streaming Submodular Maximization Under Matroid Constraints. ICALP 2022: 59:1-59:20 - [c51]Wenxin Li, Moran Feldman, Ehsan Kazemi, Amin Karbasi:
Submodular Maximization in Clean Linear Time. NeurIPS 2022 - [c50]Loay Mualem, Moran Feldman:
Using Partial Monotonicity in Submodular Maximization. NeurIPS 2022 - [i44]Loay Mualem, Moran Feldman:
Using Partial Monotonicity in Submodular Maximization. CoRR abs/2202.03051 (2022) - [i43]Kobi Bodek, Moran Feldman:
Maximizing Sums of Non-monotone Submodular and Linear Functions: Understanding the Unconstrained Case. CoRR abs/2204.03412 (2022) - [i42]Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen:
Submodular Maximization Subject to Matroid Intersection on the Fly. CoRR abs/2204.05154 (2022) - [i41]Loay Mualem, Moran Feldman:
Resolving the Approximability of Offline and Online Non-monotone DR-Submodular Maximization over General Convex Sets. CoRR abs/2210.05965 (2022) - 2021
- [j24]Moran Feldman
Guess Free Maximization of Submodular and Linear Sums. Algorithmica 83(3): 853-878 (2021) - [j23]Moran Feldman, Ola Svensson, Rico Zenklusen:
Online Contention Resolution Schemes with Applications to Bayesian Selection Problems. SIAM J. Comput. 50(2): 255-300 (2021) - [c49]Ehsan Kazemi, Shervin Minaee, Moran Feldman, Amin Karbasi:
Regularized Submodular Maximization at Scale. ICML 2021: 5356-5366 - [c48]Siddharth Mitra, Moran Feldman, Amin Karbasi:
Submodular + Concave. NeurIPS 2021: 11577-11591 - [i40]Christopher Harshaw, Ehsan Kazemi, Moran Feldman, Amin Karbasi:
The Power of Subsampling in Submodular Maximization. CoRR abs/2104.02772 (2021) - [i39]Siddharth Mitra, Moran Feldman, Amin Karbasi:
Submodular + Concave. CoRR abs/2106.04769 (2021) - [i38]Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen:
Streaming Submodular Maximization with Matroid and Matching Constraints. CoRR abs/2107.07183 (2021) - [i37]Moran Feldman, Ariel Szarf:
Maximum Matching sans Maximal Matching: A New Approach for Finding Maximum Matchings in the Data Stream Model. CoRR abs/2109.05946 (2021) - 2020
- [b2]Moran Feldman:
Algorithms for Big Data. WorldScientific 2020, ISBN 9789811204739, pp. 1-460 - [j22]Niv Buchbinder
Online submodular maximization: beating 1/2 made simple. Math. Program. 183(1): 149-169 (2020) - [j21]Moran Feldman, Moshe Tennenholtz, Omri Weinstein:
Distributed Signaling Games. ACM Trans. Economics and Comput. 8(2): 7:1-7:26 (2020) - [c47]Naor Alaluf, Alina Ene, Moran Feldman, Huy L. Nguyen, Andrew Suh:
Optimal Streaming Algorithms for Submodular Maximization with Cardinality Constraints. ICALP 2020: 6:1-6:19 - [c46]Ran Haba, Ehsan Kazemi, Moran Feldman, Amin Karbasi:
Streaming Submodular Maximization under a k-Set System Constraint. ICML 2020: 3939-3949 - [c45]Moran Feldman, Amin Karbasi:
Continuous Submodular Maximization: Beyond DR-Submodularity. NeurIPS 2020 - [c44]Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen:
The one-way communication complexity of submodular maximization with applications to streaming and robustness. STOC 2020: 1363-1374 - [i36]Ran Haba, Ehsan Kazemi, Moran Feldman, Amin Karbasi:
Streaming Submodular Maximization under a k-Set System Constraint. CoRR abs/2002.03352 (2020) - [i35]Ehsan Kazemi, Shervin Minaee, Moran Feldman, Amin Karbasi:
Regularized Submodular Maximization at Scale. CoRR abs/2002.03503 (2020) - [i34]Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen:
The One-way Communication Complexity of Submodular Maximization with Applications to Streaming and Robustness. CoRR abs/2003.13459 (2020) - [i33]Moran Feldman, Amin Karbasi:
Continuous Submodular Maximization: Beyond DR-Submodularity. CoRR abs/2006.11726 (2020) - [i32]Moran Feldman, Christopher Harshaw, Amin Karbasi:
Simultaneous Greedys: A Swiss Army Knife for Constrained Submodular Maximization. CoRR abs/2009.13998 (2020)
2010 – 2019
- 2019
- [j20]Niv Buchbinder
Constrained Submodular Maximization via a Nonsymmetric Technique. Math. Oper. Res. 44(3): 988-1005 (2019) - [j19]Niv Buchbinder, Moran Feldman
Online Submodular Maximization with Preemption. ACM Trans. Algorithms 15(3): 30:1-30:31 (2019) - [c43]Chris Harshaw, Moran Feldman, Justin Ward, Amin Karbasi:
Submodular Maximization beyond Non-negativity: Guarantees, Fast Algorithms, and Applications. ICML 2019: 2634-2643 - [c42]Niv Buchbinder, Moran Feldman, Yuval Filmus, Mohit Garg:
Online Submodular Maximization: Beating 1/2 Made Simple. IPCO 2019: 101-114 - [c41]Marko Mitrovic, Ehsan Kazemi, Moran Feldman, Andreas Krause, Amin Karbasi:
Adaptive Sequence Submodularity. NeurIPS 2019: 5353-5364 - [c40]Niv Buchbinder, Moran Feldman, Mohit Garg:
Deterministic (½ + ε)-Approximation for Submodular Maximization over a Matroid. SODA 2019: 241-254 - [c39]Lin Chen, Moran Feldman, Amin Karbasi:
Unconstrained submodular maximization with constant adaptive complexity. STOC 2019: 102-113 - [c38]Moran Feldman:
Guess Free Maximization of Submodular and Linear Sums. WADS 2019: 380-394 - [i31]Marko Mitrovic, Ehsan Kazemi, Moran Feldman, Andreas Krause, Amin Karbasi:
Adaptive Sequence Submodularity. CoRR abs/1902.05981 (2019) - [i30]Christopher Harshaw, Moran Feldman, Justin Ward, Amin Karbasi:
Submodular Maximization Beyond Non-negativity: Guarantees, Fast Algorithms, and Applications. CoRR abs/1904.09354 (2019) - [i29]Moran Feldman, Ran Haba:
Almost Optimal Semi-streaming Maximization for k-Extendible Systems. CoRR abs/1906.04449 (2019) - [i28]Naor Alaluf, Moran Feldman:
Making a Sieve Random: Improved Semi-Streaming Algorithm for Submodular Maximization under a Cardinality Constraint. CoRR abs/1906.11237 (2019) - 2018
- [j18]Moran Feldman
A Simple O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem. Math. Oper. Res. 43(2): 638-650 (2018) - [j17]Moran Feldman
The Submodular Secretary Problem Goes Linear. SIAM J. Comput. 47(2): 330-366 (2018) - [j16]Niv Buchbinder, Moran Feldman
Deterministic Algorithms for Submodular Maximization Problems. ACM Trans. Algorithms 14(3): 32:1-32:20 (2018) - [c37]Marko Mitrovic, Moran Feldman, Andreas Krause, Amin Karbasi:
Submodularity on Hypergraphs: From Sets to Sequences. AISTATS 2018: 1177-1184 - [c36]Moran Feldman
Multi-sided Advertising Markets: Dynamic Mechanisms and Incremental User Compensations. GameSec 2018: 227-247 - [c35]Lin Chen, Moran Feldman, Amin Karbasi:
Weakly Submodular Maximization Beyond Cardinality Constraints: Does Randomization Help Greedy? ICML 2018: 803-812 - [c34]Moran Feldman, Amin Karbasi, Ehsan Kazemi:
Do Less, Get More: Streaming Submodular Maximization with Subsampling. NeurIPS 2018: 730-740 - [c33]Moran Feldman
Removal and Threshold Pricing: Truthful Two-Sided Markets with Multi-dimensional Participants. SAGT 2018: 163-175 - [c32]Moran Feldman
A Framework for the Secretary Problem on the Intersection of Matroids. SODA 2018: 735-752 - [p1]Niv Buchbinder, Moran Feldman:
Submodular Functions Maximization Problems. Handbook of Approximation Algorithms and Metaheuristics (1) 2018: 753-788 - [i27]Moran Feldman, Amin Karbasi, Ehsan Kazemi:
Do Less, Get More: Streaming Submodular Maximization with Subsampling. CoRR abs/1802.07098 (2018) - [i26]Marko Mitrovic, Moran Feldman, Andreas Krause, Amin Karbasi:
Submodularity on Hypergraphs: From Sets to Sequences. CoRR abs/1802.09110 (2018) - [i25]Niv Buchbinder, Moran Feldman, Mohit Garg:
Online Submodular Maximization: Beating 1/2 Made Simple. CoRR abs/1807.05529 (2018) - [i24]Niv Buchbinder, Moran Feldman, Mohit Garg:
Deterministic (1/2 + ε)-Approximation for Submodular Maximization over a Matroid. CoRR abs/1807.05532 (2018) - [i23]Moran Feldman:
Guess Free Maximization of Submodular and Linear Sums. CoRR abs/1810.03813 (2018) - [i22]Lin Chen, Moran Feldman, Amin Karbasi:
Unconstrained Submodular Maximization with Constant Adaptive Complexity. CoRR abs/1811.06603 (2018) - 2017
- [j15]Noga Alon, Moran Feldman
Revenue and Reserve Prices in a Probabilistic Single Item Auction. Algorithmica 77(1): 1-15 (2017) - [j14]Niv Buchbinder
Comparing Apples and Oranges: Query Trade-off in Submodular Maximization. Math. Oper. Res. 42(2): 308-329 (2017) - [j13]Moran Feldman
Non-preemptive buffer management for latency sensitive packets. J. Sched. 20(4): 337-353 (2017) - [j12]Moran Feldman
Maximizing Symmetric Submodular Functions. ACM Trans. Algorithms 13(3): 39:1-39:36 (2017) - [c31]Moran Feldman, Christopher Harshaw, Amin Karbasi:
Greed Is Good: Near-Optimal Submodular Maximization via Greedy Optimization. COLT 2017: 758-784 - [c30]Ethan R. Elenberg, Alexandros G. Dimakis, Moran Feldman, Amin Karbasi:
Streaming Weak Submodularity: Interpreting Neural Networks on the Fly. NIPS 2017: 4044-4054 - [c29]Niv Buchbinder
O(depth)-Competitive Algorithm for Online Multi-level Aggregation. SODA 2017: 1235-1244 - [c28]Moran Feldman
Building a Good Team: Secretary Problems and the Supermodular Degree. SODA 2017: 1651-1670 - [i21]Niv Buchbinder
O(depth)-Competitive Algorithm for Online Multi-level Aggregation. CoRR abs/1701.01936 (2017) - [i20]Ethan R. Elenberg, Alexandros G. Dimakis, Moran Feldman, Amin Karbasi:
Streaming Weak Submodularity: Interpreting Neural Networks on the Fly. CoRR abs/1703.02647 (2017) - [i19]Moran Feldman, Christopher Harshaw, Amin Karbasi:
Greed is Good: Near-Optimal Submodular Maximization via Greedy Optimization. CoRR abs/1704.01652 (2017) - [i18]Moran Feldman, Ola Svensson, Rico Zenklusen:
A Framework for the Secretary Problem on the Intersection of Matroids. CoRR abs/1704.02608 (2017) - [i17]Lin Chen, Moran Feldman, Amin Karbasi:
Weakly Submodular Maximization Beyond Cardinality Constraints: Does Randomization Help Greedy? CoRR abs/1707.04347 (2017) - 2016
- [j11]Ron Adany, Moran Feldman
All-Or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns. ACM Trans. Algorithms 12(3): 38:1-38:25 (2016) - [j10]Moshe Babaioff, Moran Feldman
Mechanism Design with Strategic Mediators. ACM Trans. Economics and Comput. 4(2): 7:1-7:48 (2016) - [c27]Moran Feldman
Distributed Signaling Games. ESA 2016: 41:1-41:16 - [c26]Niv Buchbinder
Deterministic Algorithms for Submodular Maximization Problems. SODA 2016: 392-403 - [c25]Moran Feldman
Online Contention Resolution Schemes. SODA 2016: 1014-1033 - [i16]Moran Feldman, Rica Gonen:
Markets with Strategic Multi-minded Mediators. CoRR abs/1603.08717 (2016) - [i15]Moran Feldman, Rica Gonen:
Online Truthful Mechanisms for Multi-sided Markets. CoRR abs/1604.04859 (2016) - [i14]Niv Buchbinder
Constrained Submodular Maximization via a Non-symmetric Technique. CoRR abs/1611.03253 (2016) - 2015
- [j9]Niv Buchbinder
A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization. SIAM J. Comput. 44(5): 1384-1402 (2015) - [j8]Moran Feldman
Hedonic Clustering Games. ACM Trans. Parallel Comput. 2(1): 4:1-4:48 (2015) - [c24]Moran Feldman
Maximizing Symmetric Submodular Functions. ESA 2015: 521-532 - [c23]Moran Feldman
The Submodular Secretary Problem Goes Linear. FOCS 2015: 486-505 - [c22]Moshe Babaioff, Moran Feldman
Mechanism Design with Strategic Mediators. ITCS 2015: 307-316 - [c21]Niv Buchbinder
Comparing Apples and Oranges: Query Tradeoff in Submodular Maximization. SODA 2015: 1149-1168 - [c20]Moran Feldman
A Simple O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem. SODA 2015: 1189-1201 - [c19]Niv Buchbinder
Online Submodular Maximization with Preemption. SODA 2015: 1202-1216 - [i13]Moshe Babaioff, Moran Feldman, Moshe Tennenholtz:
Mechanism Design with Strategic Mediators. CoRR abs/1501.04457 (2015) - [i12]Niv Buchbinder
Online Submodular Maximization with Preemption. CoRR abs/1501.05801 (2015) - [i11]Moran Feldman, Rani Izsak:
Building a Good Team: Secretary Problems and the Supermodular Degree. CoRR abs/1507.06199 (2015) - [i10]Moran Feldman, Rico Zenklusen:
The Submodular Secretary Problem Goes Linear. CoRR abs/1507.08384 (2015) - [i9]Moran Feldman, Ola Svensson, Rico Zenklusen:
Online Contention Resolution Schemes. CoRR abs/1508.00142 (2015) - [i8]Niv Buchbinder
Deterministic Algorithms for Submodular Maximization Problems. CoRR abs/1508.02157 (2015) - 2014
- [j7]Niv Buchbinder
Frequency capping in online advertising. J. Sched. 17(4): 385-398 (2014) - [c18]Moran Feldman
Constrained Monotone Function Maximization and the Supermodular Degree. APPROX-RANDOM 2014: 160-175 - [c17]Niv Buchbinder
Submodular Maximization with Cardinality Constraints. SODA 2014: 1433-1452 - [i7]Moran Feldman, Moshe Tennenholtz, Omri Weinstein:
Display Advertising with Information Mediators. CoRR abs/1404.2861 (2014) - [i6]Moran Feldman, Ola Svensson, Rico Zenklusen:
A Simple Order-Oblivious O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem. CoRR abs/1404.4473 (2014) - [i5]Moran Feldman, Rani Izsak:
Constrained Monotone Function Maximization and the Supermodular Degree. CoRR abs/1407.6328 (2014) - [i4]Moran Feldman:
Maximizing Symmetric Submodular Functions. CoRR abs/1409.5900 (2014) - [i3]Niv Buchbinder
Comparing Apples and Oranges: Query Tradeoff in Submodular Maximization. CoRR abs/1410.0773 (2014) - 2013
- [b1]Moran Feldman:
Maximization problems with submodular objective functions. Technion - Israel Institute of Technology, Israel, 2013 - [c16]Ron Adany, Moran Feldman
All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns. IPCO 2013: 13-24 - [c15]Moran Feldman
Competition in the Presence of Social Networks: How Many Service Providers Maximize Welfare? WINE 2013: 174-187 - 2012
- [j6]Moran Feldman
Improved approximation algorithms for Directed Steiner Forest. J. Comput. Syst. Sci. 78(1): 279-292 (2012) - [c14]Niv Buchbinder
A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization. FOCS 2012: 649-658 - [c13]Moran Feldman
Interviewing secretaries in parallel. EC 2012: 550-567 - [c12]Moran Feldman
Hedonic clustering games. SPAA 2012: 267-276 - 2011
- [j5]Yosi Ben-Asher, Sharoni Feldman, Moran Feldman
Dynamic Multipath Allocation in Ad Hoc Networks. Comput. J. 54(2): 197-212 (2011) - [c11]Moran Feldman
Improved Competitive Ratios for Submodular Secretary Problems (Extended Abstract). APPROX-RANDOM 2011: 218-229 - [c10]Moran Feldman
Improved Approximations for k-Exchange Systems - (Extended Abstract). ESA 2011: 784-798 - [c9]Moran Feldman
A Unified Continuous Greedy Algorithm for Submodular Maximization. FOCS 2011: 570-579 - [c8]Moran Feldman
Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm - (Extended Abstract). ICALP (1) 2011: 342-353 - [c7]Niv Buchbinder
Frequency Capping in Online Advertising. WADS 2011: 147-158 - [i2]Moran Feldman, Ronny Lempel, Oren Somekh, Kolman Vornovitsky:
On the Impact of Random Index-Partitioning on Index Compression. CoRR abs/1107.5661 (2011) - 2010
- [j4]Yosi Ben-Asher, Sharoni Feldman, Moran Feldman
Scalability Issues in Ad-Hoc Networks: Metrical Routing Versus Table-Driven Routing. Wirel. Pers. Commun. 52(3): 423-447 (2010) - [c6]Munmun De Choudhury, Moran Feldman
Automatic construction of travel itineraries using social breadcrumbs. HT 2010: 35-44 - [c5]Moran Feldman
Non-Preemptive Buffer Management for Latency Sensitive Packets. INFOCOM 2010: 186-190 - [c4]Munmun De Choudhury, Moran Feldman
Constructing travel itineraries from tagged geo-temporal breadcrumbs. WWW 2010: 1083-1084
2000 – 2009
- 2009
- [c3]Moran Feldman
Improved approximating algorithms for Directed Steiner Forest. SODA 2009: 922-931 - 2008
- [j3]Yosi Ben-Asher, Sharoni Feldman, Pini Gurfil
Hierarchical Task Assignment and Communication Algorithms for Unmanned Aerial Vehicle Flocks. J. Aerosp. Comput. Inf. Commun. 5(8): 234-250 (2008) - [j2]Yosi Ben-Asher, Sharoni Feldman, Pini Gurfil
Distributed Decision and Control for Cooperative UAVs Using Ad Hoc Communication. IEEE Trans. Control. Syst. Technol. 16(3): 511-516 (2008) - 2007
- [j1]Yosi Ben-Asher, Moran Feldman
IFAS: Interactive flexible ad hoc simulator. Simul. Model. Pract. Theory 15(7): 817-830 (2007) - [i1]Moran Feldman, Guy Kortsarz, Zeev Nutov:
Improved approximation algorithms for directed Steiner forest. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [c2]Yosi Ben-Asher, Moran Feldman
Metrical Routing using Ad-Hoc Networks in Hierarchical Environment. ITRE 2006: 61-68 - [c1]Yosi Ben-Asher, Moran Feldman, Sharoni Feldman:
Ad-Hoc Routing Using Virtual Coordinates Based on Rooted Trees. SUTC (1) 2006: 6-13
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-12-10 20:45 CET 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: