Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
40 | Yehuda Afek, Eran Shalom |
Less Is More: Consensus Gaps Between Restricted and Unrestricted Objects. |
DISC |
2006 |
DBLP DOI BibTeX RDF |
Consensus hierarchy, Common2, Bounded-use, Bounded-size, Long-lived, Fetch&Add, Queues, Stacks, Set, Wait-free, Swap |
37 | Rainer Gemulla, Wolfgang Lehner, Peter J. Haas |
Maintaining bounded-size sample synopses of evolving datasets. |
VLDB J. |
2008 |
DBLP DOI BibTeX RDF |
Database sampling, Reservoir sampling, Sample maintenance, Synopsis |
26 | Naomi Nishimura, Prabhakar Ragde, Stefan Szeider |
Solving #SAT using vertex covers. |
Acta Informatica |
2007 |
DBLP DOI BibTeX RDF |
|
26 | Naomi Nishimura, Prabhakar Ragde, Stefan Szeider |
Solving #SAT Using Vertex Covers. |
SAT |
2006 |
DBLP DOI BibTeX RDF |
|
23 | Daya Ram Gaur, Ramesh Krishnamurti |
Self-Duality of Bounded Monotone Boolean Functions and Related Problems. |
ALT |
2000 |
DBLP DOI BibTeX RDF |
|
21 | Camilo Thorne |
Categorial Module Grammars of Bounded Size have Finite Bounded Density. |
LATA |
2007 |
DBLP BibTeX RDF |
|
21 | David Bremner, Ferran Hurtado, Suneeta Ramaswami, Vera Sacristán |
Small Strictly Convex Quadrilateral Meshes of Point Sets. |
Algorithmica |
2004 |
DBLP DOI BibTeX RDF |
Quadrangulation, Bounded size, Interpolation, Finite elements, Convex, Quadrilateral mesh |
21 | Alberto Negro, Nicola Santoro, Jorge Urrutia |
Efficient Distributed Selection with Bounded Messages. |
IEEE Trans. Parallel Distributed Syst. |
1997 |
DBLP DOI BibTeX RDF |
Bounded-size messages, distributed sets, K-selection, distributed algorithms, communication networks, communication complexity |
21 | Sergio De Agostino, Riccardo Silvestri |
Bounded Size Dictionary Compression: SCk-Completeness and NC Algorithms. |
STACS |
1998 |
DBLP DOI BibTeX RDF |
|
17 | Albert Atserias |
Conjunctive Query Evaluation by Search Tree Revisited. |
ICDT |
2005 |
DBLP DOI BibTeX RDF |
|
16 | Felix Ulmer, Jacques Calmet |
On Liouvillian Solutions of Homogeneous Linear Differential Equations. |
ISSAC |
1990 |
DBLP DOI BibTeX RDF |
|
16 | Endre Boros, Khaled M. Elbassioni, Kazuhisa Makino |
On Berge Multiplication for Monotone Boolean Dualization. |
ICALP (1) |
2008 |
DBLP DOI BibTeX RDF |
|
15 | Marta Arias, Roni Khardon |
The Subsumption Lattice and Query Learning. |
ALT |
2004 |
DBLP DOI BibTeX RDF |
|
15 | Gadi Taubenfeld |
The Black-White Bakery Algorithm and Related Bounded-Space, Adaptive, Local-Spinning and FIFO Algorithms. |
DISC |
2004 |
DBLP DOI BibTeX RDF |
|
14 | Sergio De Agostino |
Greedy versus optimal analysis of bounded size dictionary compression and on-the-fly distributed computing. |
Discret. Appl. Math. |
2024 |
DBLP DOI BibTeX RDF |
|
14 | Laurent Gourvès, Aris Pagourtzis |
Removable Online Knapsack with Bounded Size Items. |
SOFSEM |
2024 |
DBLP DOI BibTeX RDF |
|
14 | Carole Delporte, Hugues Fauconnier, Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers |
The Computational Power of Distributed Shared-Memory Models with Bounded-Size Registers. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
14 | Barun Gorain, Shaswati Patra, Rishi Ranjan Singh |
Graph Covering Using Bounded Size Subgraphs. |
CALDAM |
2023 |
DBLP DOI BibTeX RDF |
|
14 | Gianpiero Monaco, Luca Moscardelli |
Nash Stability in Fractional Hedonic Games with Bounded Size Coalitions. |
WINE |
2023 |
DBLP DOI BibTeX RDF |
|
14 | Sergio De Agostino |
A Worst Case Analysis of the LZ2 Compression Algorithm with Bounded Size Dictionaries. |
PSC |
2023 |
DBLP BibTeX RDF |
|
14 | Hemanta K. Maji, Hai H. Nguyen, Anat Paskin-Cherniavsky, Tom Suad, Mingyuan Wang 0001, Xiuyu Ye, Albert Yu 0003 |
Leakage-resilient Linear Secret-sharing Against Arbitrary Bounded-size Leakage Family. |
TCC (1) |
2022 |
DBLP DOI BibTeX RDF |
|
14 | Yusuke Sakai 0001 |
Succinct Attribute-Based Signatures for Bounded-Size Circuits by Combining Algebraic and Arithmetic Proofs. |
SCN |
2022 |
DBLP DOI BibTeX RDF |
|
14 | Christoph Hertrich, Martin Skutella |
Provably Good Solutions to the Knapsack Problem via Neural Networks of Bounded Size. |
AAAI |
2021 |
DBLP DOI BibTeX RDF |
|
14 | Christoph Hertrich, Martin Skutella |
Provably Good Solutions to the Knapsack Problem via Neural Networks of Bounded Size. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
14 | Ilkyoo Choi, François Dross, Pascal Ochem |
Partitioning sparse graphs into an independent set and a graph with bounded size components. |
Discret. Math. |
2020 |
DBLP DOI BibTeX RDF |
|
14 | Jochen Könemann, Kanstantsin Pashkovich, Natig Tofigzade |
Approximating Stable Matchings with Ties of Bounded Size. |
SAGT |
2020 |
DBLP DOI BibTeX RDF |
|
14 | Sergio De Agostino |
Greedy versus Optimal Analysis of Bounded Size Dictionary Compression and On-the-Fly Distributed Computing. |
Stringology |
2020 |
DBLP BibTeX RDF |
|
14 | Sebastian Forster, Liu Yang |
A Faster Local Algorithm for Detecting Bounded-Size Cuts with Applications to Higher-Connectivity Problems. |
CoRR |
2019 |
DBLP BibTeX RDF |
|
14 | Ilkyoo Choi, François Dross, Pascal Ochem |
Partitioning sparse graphs into an independent set and a graph with bounded size components. |
CoRR |
2019 |
DBLP BibTeX RDF |
|
14 | Jianpeng Zhang, Yulong Pei, George H. L. Fletcher, Mykola Pechenizkiy |
A bounded-size clustering algorithm on fully-dynamic streaming graphs. |
Intell. Data Anal. |
2018 |
DBLP DOI BibTeX RDF |
|
14 | Mingyu Xiao 0001 |
Linear kernels for separating a graph into components of bounded size. |
J. Comput. Syst. Sci. |
2017 |
DBLP DOI BibTeX RDF |
|
14 | Minghui Zhang, Xin Han, Yan Lan, Hing-Fung Ting |
Online bin packing problem with buffer and bounded size revisited. |
J. Comb. Optim. |
2017 |
DBLP DOI BibTeX RDF |
|
14 | Mingyu Xiao 0001 |
Linear Kernels for Separating a Graph into Components of Bounded Size. |
CoRR |
2016 |
DBLP BibTeX RDF |
|
14 | Tatiana Bradley, Sky Faber, Gene Tsudik |
Bounded Size-Hiding Private Set Intersection. |
IACR Cryptol. ePrint Arch. |
2016 |
DBLP BibTeX RDF |
|
14 | Philippe Jégou, Hanan Kanso, Cyril Terrioux |
Towards a Dynamic Decomposition of CSPs with Separators of Bounded Size. |
CP |
2016 |
DBLP DOI BibTeX RDF |
|
14 | Tatiana Bradley, Sky Faber, Gene Tsudik |
Bounded Size-Hiding Private Set Intersection. |
SCN |
2016 |
DBLP DOI BibTeX RDF |
|
14 | Mario Alviano, Carmine Dodaro, Francesco Ricca |
A MaxSAT Algorithm Using Cardinality Constraints of Bounded Size. |
IJCAI |
2015 |
DBLP BibTeX RDF |
|
14 | Shankar Bhamidi, Amarjit Budhiraja, Xuan Wang |
Bounded-Size Rules: The Barely Subcritical Regime. |
Comb. Probab. Comput. |
2014 |
DBLP DOI BibTeX RDF |
|
14 | Colette Johnen, Fouzi Mekhaldi |
Self-stabilizing with service guarantee construction of 1-hop weight-based bounded size clusters. |
J. Parallel Distributed Comput. |
2014 |
DBLP DOI BibTeX RDF |
|
14 | Rainer Gemulla, Peter J. Haas, Wolfgang Lehner |
Non-uniformity issues and workarounds in bounded-size sampling. |
VLDB J. |
2013 |
DBLP DOI BibTeX RDF |
|
14 | Heger Arfaoui, Pierre Fraigniaud, Andrzej Pelc |
Local Decision and Verification with Bounded-Size Outputs. |
SSS |
2013 |
DBLP DOI BibTeX RDF |
|
14 | Kunihiro Wasa, Yusaku Kaneta, Takeaki Uno, Hiroki Arimura |
Constant Time Enumeration of Bounded-Size Subtrees in Trees and Its Application. |
COCOON |
2012 |
DBLP DOI BibTeX RDF |
|
14 | Ken-ichi Kawarabayashi, Mikkel Thorup |
Minimum k-way cut of bounded size is fixed-parameter tractable |
CoRR |
2011 |
DBLP BibTeX RDF |
|
14 | Ken-ichi Kawarabayashi, Mikkel Thorup |
The Minimum k-way Cut of Bounded Size is Fixed-Parameter Tractable. |
FOCS |
2011 |
DBLP DOI BibTeX RDF |
|
14 | Rui A. Ferreira, Roberto Grossi, Romeo Rizzi |
Output-Sensitive Listing of Bounded-Size Trees in Undirected Graphs. |
ESA |
2011 |
DBLP DOI BibTeX RDF |
|
14 | Giulia Galbiati |
Approximating Minimum Cut with Bounded Size. |
INOC |
2011 |
DBLP DOI BibTeX RDF |
|
14 | Alain Bui, Simon Clavière, Ajoy Kumar Datta, Lawrence L. Larmore, Devan Sohier |
Self-stabilizing Hierarchical Construction of Bounded Size Clusters. |
SIROCCO |
2011 |
DBLP DOI BibTeX RDF |
|
14 | Colette Johnen, Fouzi Mekhaldi |
Robust Self-stabilizing Construction of Bounded Size Weight-Based Clusters. |
Euro-Par (1) |
2010 |
DBLP DOI BibTeX RDF |
|
14 | Colette Johnen, Fouzi Mekhaldi |
Brief Announcement: Robust Self-stabilizing Construction of Bounded Size Weight-Based Clusters. |
SSS |
2009 |
DBLP DOI BibTeX RDF |
|
14 | Rohit Khandekar, Kirsten Hildrum, Sujay S. Parekh, Deepak Rajan, Jay Sethuraman, Joel L. Wolf |
Bounded Size Graph Clustering with Applications to Stream Processing. |
FSTTCS |
2009 |
DBLP DOI BibTeX RDF |
|
14 | Colette Johnen, Le Huy Nguyen |
Self-Stabilizing Construction of Bounded Size Clusters. |
ISPA |
2008 |
DBLP DOI BibTeX RDF |
|
14 | Grzegorz Malewicz |
Latin squares with bounded size of row prefix intersections. |
Discret. Appl. Math. |
2006 |
DBLP DOI BibTeX RDF |
|
14 | Sergio De Agostino |
Bounded Size Dictionary Compression: Relaxing the Lru Deletion Heuristic. |
Int. J. Found. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
14 | Suneeta Ramaswami, Marcelo Siqueira, Tessa A. Sundaram, Jean H. Gallier, James C. Gee |
Constrained quadrilateral meshes of bounded size. |
Int. J. Comput. Geom. Appl. |
2005 |
DBLP DOI BibTeX RDF |
|
14 | Daniel Král, Jirí Sgall |
Coloring graphs from lists with bounded size of their union. |
J. Graph Theory |
2005 |
DBLP DOI BibTeX RDF |
|
14 | Sergio De Agostino |
Bounded size dictionary compression: Relaxing the LRU deletion heuristic. |
Stringology |
2005 |
DBLP BibTeX RDF |
|
14 | Sergio De Agostino |
Bounded Size Dictionary Compression: Relaxing the LRU Deletion Heuristic. |
DCC |
2005 |
DBLP DOI BibTeX RDF |
|
14 | Brenda J. Latka |
Antichains of Bounded Size in the Class of Tournaments. |
Order |
2003 |
DBLP DOI BibTeX RDF |
subtournament, embedding, tournament, antichain |
14 | Yunhong Zhou, Subhash Suri |
Geometric permutations of balls with bounded size disparity. |
Comput. Geom. |
2003 |
DBLP DOI BibTeX RDF |
|
14 | Sergio De Agostino, Riccardo Silvestri |
Bounded size dictionary compression: SCk-completeness and NC algorithms. |
Inf. Comput. |
2003 |
DBLP DOI BibTeX RDF |
|
14 | Penny E. Haxell, Tibor Szabó, Gábor Tardos |
Bounded size components--partitions and transversals. |
J. Comb. Theory, Ser. B |
2003 |
DBLP DOI BibTeX RDF |
|
14 | Francis C. M. Lau 0001, Shi-Heng Zhang |
Fast Gossiping in Square Meshes/Tori with Bounded-Size Packets. |
IEEE Trans. Parallel Distributed Syst. |
2002 |
DBLP DOI BibTeX RDF |
scheduling, parallel algorithms, interconnection networks, gossiping, collective communication, communication optimization, all-to-all broadcast, total exchange |
14 | Malin Christersson, Leszek Gasieniec, Andrzej Lingas |
Gossiping with Bounded Size Messages in ad hoc Radio Networks. |
ICALP |
2002 |
DBLP DOI BibTeX RDF |
|
14 | Yunhong Zhou, Subhash Suri |
Geometric permutations of balls with bounded size disparity. |
CCCG |
2001 |
DBLP BibTeX RDF |
|
14 | Yehuda Afek, Gideon Stupp |
Delimiting the Power of Bounded Size Synchronization Objects (Extended Abstract). |
PODC |
1994 |
DBLP DOI BibTeX RDF |
|
14 | Zvi Galil |
On Resolution with Clauses of Bounded Size. |
SIAM J. Comput. |
1977 |
DBLP DOI BibTeX RDF |
|
14 | Stratis Ioannidis, Christos Nomikos, Aris Pagourtzis, Stathis Zachos |
Routing and Wavelength Assignment in Generalized WDM Tree Networks of Bounded Degree. |
Panhellenic Conference on Informatics |
2005 |
DBLP DOI BibTeX RDF |
routing and path coloring, optical networking, wavelength assignment, WDM networks |
14 | Frank Stephan 0001, Thomas Zeugmann |
On the Uniform Learnability of Approximations to Non-Recursive Functions. |
ALT |
1999 |
DBLP DOI BibTeX RDF |
|
14 | Georg Gottlob, Francesco Scarcello, Martha Sideri |
Fixed-Parameter Complexity in AI and Nonmonotonic Reasoning. |
LPNMR |
1999 |
DBLP DOI BibTeX RDF |
Complexity, Logic Programming, Constraint Satisfaction, Nonmonotonic Reasoning, Fixed-parameter Tractability, Stable Models, Prime Implicants, Circumscription |
14 | John Case, Sanjay Jain 0001, Susanne Kaufmann, Arun Sharma 0001, Frank Stephan 0001 |
Predictive Learning Models for Concept Drift. |
ALT |
1998 |
DBLP DOI BibTeX RDF |
|
13 | Ivan Damgård, Serge Fehr, Louis Salvail, Christian Schaffner |
Cryptography In the Bounded Quantum-Storage Model. |
FOCS |
2005 |
DBLP DOI BibTeX RDF |
|
12 | Constantinos Daskalakis, Christos H. Papadimitriou |
On oblivious PTAS's for nash equilibrium. |
STOC |
2009 |
DBLP DOI BibTeX RDF |
anonymous games, oblivious algorithms, PTAS, bimatrix games |
12 | Sushanta Karmakar, Arobinda Gupta |
Bounded Clustering with Low Node-Clusterhead Separation in Wireless Sensor Networks. |
ISPAN |
2005 |
DBLP DOI BibTeX RDF |
|
12 | Liana Bozga, Yassine Lakhnech, Michaël Périn |
HERMES: An Automatic Tool for Verification of Secrecy in Security Protocols. |
CAV |
2003 |
DBLP DOI BibTeX RDF |
|
12 | Alexandr Andoni, Piotr Indyk, Robert Krauthgamer |
Earth mover distance over high-dimensional spaces. |
SODA |
2008 |
DBLP BibTeX RDF |
|
12 | Lyudmil Aleksandrov, Hristo N. Djidjev, Hua Guo, Anil Maheshwari |
Partitioning Planar Graphs with Costs and Weights. |
ALENEX |
2002 |
DBLP DOI BibTeX RDF |
|
12 | Erich Grädel |
Size of Models versus Length of Computations: On Inseparability by Nondeterministic Time Complexity Classes. |
CSL |
1988 |
DBLP DOI BibTeX RDF |
|
10 | Linda S. Moonen, Frits C. R. Spieksma |
Partitioning a weighted partial order. |
J. Comb. Optim. |
2008 |
DBLP DOI BibTeX RDF |
Chain decomposition, Approximation algorithms, Partially ordered sets |
10 | Patrik Floréen, Petteri Kaski, Topi Musto, Jukka Suomela |
Approximating max-min linear programs with local algorithms. |
IPDPS |
2008 |
DBLP DOI BibTeX RDF |
|
10 | H. K. Dai 0001, Y. Du |
On the Bounded-Delay Minimum-Cost Path Problem of Quality-of-Service Routing. |
ICCCN |
2007 |
DBLP DOI BibTeX RDF |
|
10 | Lyudmil Aleksandrov, Hristo N. Djidjev, Hua Guo, Anil Maheshwari |
Partitioning planar graphs with costs and weights. |
ACM J. Exp. Algorithmics |
2006 |
DBLP DOI BibTeX RDF |
graph partitioning algorithms, implementation, Graph algorithms, graph separators |
10 | Yehuda Afek, Danny Dolev, Eli Gafni |
A Bounded First-In, First-Enabled Solution to the 1-Exclusion Problem. |
WDAG |
1990 |
DBLP DOI BibTeX RDF |
|
10 | Thomas Polzer, Thomas Handl, Andreas Steininger |
A Metastability-Free Multi-synchronous Communication Scheme for SoCs. |
SSS |
2009 |
DBLP DOI BibTeX RDF |
|
9 | Michael Emmerich, Nicola Beume, Boris Naujoks |
An EMO Algorithm Using the Hypervolume Measure as Selection Criterion. |
EMO |
2005 |
DBLP DOI BibTeX RDF |
|
9 | Kleoni Ioannidou |
Transformations of Self-Stabilizing Algorithms. |
DISC |
2002 |
DBLP DOI BibTeX RDF |
|
9 | Nader H. Bshouty |
On the Complexity of Functions for Random Access Machines. |
J. ACM |
1993 |
DBLP DOI BibTeX RDF |
indirect addressing, sorting, greatest common divisor, random access machine |
9 | Rogério de Lemos, Paul D. Ezhilchelvan |
Agreement on the Group Membership in Synchronous Distributed Systems. |
WDAG |
1990 |
DBLP DOI BibTeX RDF |
fault-tolerance, distributed algorithms, group membership, broadcast networks |
8 | Marcus Krug, Dorothea Wagner |
Minimizing the Area for Planar Straight-Line Grid Drawings. |
GD |
2007 |
DBLP DOI BibTeX RDF |
|
8 | Manuel Bodirsky, Daniel Král |
Locally Consistent Constraint Satisfaction Problems with Binary Constraints. |
WG |
2005 |
DBLP DOI BibTeX RDF |
|
7 | Wenfei Fan, Floris Geerts |
Capturing missing tuples and missing values. |
PODS |
2010 |
DBLP DOI BibTeX RDF |
information completeness, master data, missing data |
7 | Trac N. Nguyen, Dung T. Huynh |
Energy-Efficient Connected D-Hop Dominating Sets in Wireless Sensor Networks. |
PerCom Workshops |
2009 |
DBLP DOI BibTeX RDF |
|
7 | László Lovász 0001 |
Some Mathematics Behind Graph Property Testing. |
Discovery Science |
2008 |
DBLP DOI BibTeX RDF |
|
7 | Vipul Goyal, Abhishek Jain 0002, Omkant Pandey, Amit Sahai |
Bounded Ciphertext Policy Attribute Based Encryption. |
ICALP (2) |
2008 |
DBLP DOI BibTeX RDF |
|
7 | Florian Schoppmann |
The Power of Small Coalitions in Cost Sharing. |
WINE |
2008 |
DBLP DOI BibTeX RDF |
|
7 | Roberto M. Amadio |
Max-Plus Quasi-interpretations. |
TLCA |
2003 |
DBLP DOI BibTeX RDF |
Functional languages and term rewriting, Function algebras and implicit computational complexity, Polynomial interpretations and max-plus algebras, Static analysis |
7 | Stavros G. Kolliopoulos, George Steiner |
Partially-Ordered Knapsack and Applications to Scheduling. |
ESA |
2002 |
DBLP DOI BibTeX RDF |
|
7 | Bernd Schmeltz |
Optimal Tradeoffs Between Time And Bit Complexity In Distributed Synchronous Rings. |
STACS |
1991 |
DBLP DOI BibTeX RDF |
|
7 | David G. Kirkpatrick, Maria M. Klawe, Robert Endre Tarjan |
Polygon Triangulation in O(n log log n) Time with Simple Data-Structures. |
SCG |
1990 |
DBLP DOI BibTeX RDF |
|
5 | Phokion G. Kolaitis, Swastik Kopparty |
Random graphs and the parity quantifier. |
STOC |
2009 |
DBLP DOI BibTeX RDF |
0-1 law, AC0, modular convergence, first-order logic |
5 | Jörg Bauer 0001, Iovka Boneva, Marcos E. Kurbán, Arend Rensink |
A Modal-Logic Based Graph Abstraction. |
ICGT |
2008 |
DBLP DOI BibTeX RDF |
|