ICALP 2009 - PDF Preprint Papers

ICALP 2009 International Colloquium on Automata

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed ICALP-2009 Paper

click to vote

ICALP
2009
Springer

251views Programming Languages» more ICALP 2009»

Rumor Spreading in Social Networks

14 years 5 months ago

Download lightless.org

Social networks are an interesting class of graphs likely to become of increasing importance in the future, not only theoretically, but also for its probable applications to ad hoc...

Flavio Chierichetti, Silvio Lattanzi, Alessandro P...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	251	Rumor Spreading in Social Networks	claim
2	211	LTL Path Checking Is Efficiently Parallelizable	claim
3	208	Counting Subgraphs via Homomorphisms	claim
4	199	SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs	claim
5	184	Assigning Papers to Referees	claim
6	183	Tight Bounds for the Cover Time of Multiple Random Walks	claim
7	178	A Survey of Stochastic Games with Limsup and Liminf Objectives	claim
8	170	On Regular Temporal Logics with Past,	claim
9	166	Limits and Applications of Group Algebras for Parameterized Problems	claim
10	166	On Cartesian Trees and Range Minimum Queries	claim
11	163	Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus	claim
12	157	Algorithms for Secretary Problems on Graphs and Hypergraphs	claim
13	151	Elimination Graphs	claim
14	150	Fast FAST	claim
15	147	Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs	claim
16	146	Approximating Markov Processes by Averaging	claim
17	146	Approximating Matches Made in Heaven	claim
18	140	Popular Mixed Matchings	claim
19	139	Approximating Decision Trees with Multiway Branches	claim
20	138	Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs	claim
21	137	Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness	claim
22	134	Towards a Study of Low-Complexity Graphs	claim
23	134	Correlation Clustering Revisited: The "True" Cost of Error Minimization Problems	claim
24	134	Testing Fourier Dimensionality and Sparsity	claim
25	134	Boundedness of Monadic Second-Order Formulae over Finite Words	claim
26	132	Qualitative Concurrent Stochastic Games with Imperfect Information	claim
27	130	Learning Halfspaces with Malicious Noise	claim
28	130	A Distributed and Oblivious Heap	claim
29	127	Secure Function Collection with Sublinear Storage	claim
30	127	Competitive Analysis of Aggregate Max in Windowed Streaming	claim
31	126	Graph Sparsification in the Semi-streaming Model	claim
32	126	Weak Alternating Timed Automata	claim
33	125	Bounds on the Size of Small Depth Circuits for Approximating Majority	claim
34	124	Limiting Negations in Formulas	claim
35	124	On Constructor Rewrite Systems and the Lambda-Calculus	claim
36	124	Exact and Approximate Bandwidth	claim
37	122	Annotations in Data Streams	claim
38	122	A Better Algorithm for Random k-SAT	claim
39	120	The Ehrenfeucht-Silberger Problem	claim
40	120	The Theory of Stabilisation Monoids and Regular Cost Functions	claim
41	119	Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures	claim
42	115	Sleep with Guilt and Work Faster to Minimize Flow Plus Energy	claim
43	115	Smoothed Analysis of Balancing Networks	claim
44	114	De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results	claim
45	114	On Finding Dense Subgraphs	claim
46	113	MANETS: High Mobility Can Make Up for Low Transmission Power	claim
47	112	B-Treaps: A Uniquely Represented Alternative to B-Trees	claim
48	111	On a Network Generalization of the Minmax Theorem	claim
49	109	Towards Optimal Range Medians	claim
50	109	Maximum Bipartite Flow in Networks with Adaptive Channel Width	claim
51	108	Dynamic Succinct Ordered Trees	claim
52	108	The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games	claim
53	108	Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule	claim
54	107	Incompressibility through Colors and IDs	claim
55	106	A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata	claim
56	106	Efficient Methods for Selfish Network Design	claim
57	105	Proportional Response Dynamics in the Fisher Market	claim
58	104	External Sampling	claim
59	103	Rate-Based Transition Systems for Stochastic Process Calculi	claim
60	103	Deciding Safety Properties in Infinite-State Pi-Calculus via Behavioural Types	claim
61	102	Decidability of Conjugacy of Tree-Shifts of Finite Type	claim
62	102	Universal Succinct Representations of Trees?	claim
63	101	Strong and Pareto Price of Anarchy in Congestion Games	claim
64	101	Decidability of the Guarded Fragment with the Transitive Closure	claim
65	100	Improved Algorithms for Latency Minimization in Wireless Networks	claim
66	100	A Decidable Characterization of Locally Testable Tree Languages	claim
67	99	The Number of Symbol Comparisons in QuickSort and QuickSelect	claim
68	99	Unconditional Lower Bounds against Advice	claim
69	99	Semilinear Program Feasibility	claim
70	98	Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies	claim
71	98	Forward Analysis for WSTS, Part II: Complete WSTS	claim
72	96	Revisiting the Direct Sum Theorem and Space Lower Bounds in Random Order Streams	claim
73	95	Factoring Groups Efficiently	claim
74	95	Multi-armed Bandits with Metric Switching Costs	claim
75	95	When Are Timed Automata Determinizable?	claim
76	94	An Explicit Formula for the Free Exponential Modality of Linear Logic	claim
77	93	Sorting and Selection with Imprecise Comparisons	claim
78	93	On Observing Dynamic Prioritised Actions in SOC	claim
79	92	Functional Monitoring without Monotonicity	claim
80	92	Reachability in Stochastic Timed Games	claim
81	91	Mediated Population Protocols	claim
82	90	The Tile Complexity of Linear Assemblies	claim
83	90	Multiple Random Walks and Interacting Particle Systems	claim
84	89	High Complexity Tilings with Sparse Errors	claim
85	88	Superhighness and Strong Jump Traceability	claim
86	86	Distortion Is Fixed Parameter Tractable	claim
87	85	Improved Bounds for Flow Shop Scheduling	claim
88	85	A Graph Reduction Step Preserving Element-Connectivity and Applications	claim
89	82	Online Computation with Advice	claim
90	78	Wireless Communication Is in APX	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers