IPL 2010 - PDF Preprint Papers

IPL 2010

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed IPL-2010 Paper

click to vote

IPL
2010

302views more IPL 2010»

Reference count analysis with shallow aliasing

13 years 1 months ago

Download research.microsoft.com

Akash Lal, G. Ramalingam

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	302	Reference count analysis with shallow aliasing	claim
2	247	The Floyd-Warshall algorithm on graphs with negative cycles	claim
3	180	The effects of the omission of last round's MixColumns on AES	claim
4	160	Antimagic labeling and canonical decomposition of graphs	claim
5	158	Finding bipartite subgraphs efficiently	claim
6	141	On the differential and linear efficiency of balanced Feistel networks	claim
7	139	A note on competitive diffusion through social networks	claim
8	137	Online coloring of hypergraphs	claim
9	134	Refining abstract interpretations	claim
10	134	Parameterized algorithm for eternal vertex cover	claim
11	130	In search of lost time	claim
12	119	Note on Max Lin-2 above Average	claim
13	117	An improved algorithm for sorting by block-interchanges based on permutation groups	claim
14	115	Hardness and approximation of minimum distortion embeddings	claim
15	114	Alphabetic coding with exponential costs	claim
16	112	The cost of probabilistic agreement in oblivious robot networks	claim
17	111	Connecting face hitting sets in planar graphs	claim
18	109	A new parameter for a broadcast algorithm with locally bounded Byzantine faults	claim
19	107	Disjoint pattern matching and implication in strings	claim
20	107	Collisions for variants of the BLAKE hash function	claim
21	98	Distinguishing attacks on stream ciphers based on arrays of pseudo-random words	claim
22	95	Resource bisimilarity and graded bisimilarity coincide	claim
23	94	Partial model checking via abstract interpretation	claim
24	94	Finding frequent items over sliding windows with constant update time	claim
25	94	A compact data structure for representing a dynamic multiset	claim
26	93	Compiling and securing cryptographic protocols	claim
27	93	Randomized algorithms for online bounded bidding	claim
28	92	Learning parities in the mistake-bound model	claim
29	91	Total coloring of planar graphs of maximum degree eight	claim
30	89	Hard problems in max-algebra, control theory, hypergraphs and other areas	claim
31	87	One-inclusion hypergraph density revisited	claim
32	84	Wee LCP	claim
33	82	New upper bounds on the Boolean circuit complexity of symmetric functions	claim
34	81	An alternative characterization of weak order dependence	claim
35	80	Rate monotonic scheduling re-analysed	claim
36	80	A note on isosceles planar graph drawing	claim
37	80	The reachability problem for branching vector addition systems requires doubly-exponential space	claim
38	79	A set coverage problem	claim
39	79	Unrestricted and complete Breadth-First Search of trapezoid graphs in O(n) time	claim
40	75	A new analysis of the false positive rate of a Bloom filter	claim
41	74	The repeater tree construction problem	claim
42	72	Fully symmetric swapped networks based on bipartite cluster connectivity	claim
43	72	A local decision test for sparse polynomials	claim
44	71	New common ancestor problems in trees and directed acyclic graphs	claim
45	69	Complexity of semi-stable and stage semantics in argumentation frameworks	claim
46	69	A simple representation of subwords of the Fibonacci word	claim
47	69	On the additive constant of the k-server Work Function Algorithm	claim
48	69	Enumeration of balanced symmetric functions over GF(p)	claim
49	69	KCube: A novel architecture for interconnection networks	claim
50	68	Permuted function matching	claim
51	66	There is no EPTAS for two-dimensional knapsack	claim
52	65	A network flow based approach for network selection in dynamic spectrum access networks	claim
53	65	Multicasting in the hypercube, chord and binomial graphs	claim
54	64	Whole mirror duplication-random loss model and pattern avoiding permutations	claim
55	61	Optimizing the Region Algebra is PSPACE-complete	claim
56	59	Log' version vector: Logging version vectors concisely in dynamic replication	claim
57	57	Weakly-non-overlapping non-collapsing shallow term rewriting systems are confluent	claim
58	52	Efficient indexing algorithms for one-dimensional discretely-scaled strings	claim
59	44	A polylogarithmic approximation for computing non-metric terminal Steiner trees	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers