Search results for "perfect"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
82	Josep Rifà, Jaume Pujol, Joaquim Borges	1-Perfect Uniform and Distance Invariant Partitions.	Appl. Algebra Eng. Commun. Comput.	2001	DBLP DOI BibTeX RDF	Perfect propelinear codes, Perfect uniform partitions, Perfect distance invariant partitions
59	Lior Malka	How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge.	TCC	2008	DBLP DOI BibTeX RDF	non-interactive, perfect zero-knowledge, error shifting, complete problems, cryptography, perfect simulation
56	Dan Gusfield	The Multi-State Perfect Phylogeny Problem with Missing and Removable Data: Solutions via Integer-Programming and Chordal Graph Theory.	RECOMB	2009	DBLP DOI BibTeX RDF	graph triangulation, integer programming, computational biology, chordal graphs, phylogenetics, perfect phylogeny
56	K. Srinathan, N. Tharani Rajan, C. Pandu Rangan	Non-perfect Secret Sharing over General Access Structures.	INDOCRYPT	2002	DBLP DOI BibTeX RDF	non-threshold secret sharing, non-perfect secret sharing
55	Stavros D. Nikolopoulos, Leonidas Palios	Maximum-Size Subgraphs of P4-Sparse Graphs Admitting a Perfect Matching.	Panhellenic Conference on Informatics	2005	DBLP DOI BibTeX RDF	P4-sparse graphs, maximum-size subgraphs, perfect matching, maximum matchings, Perfect graphs, cographs
53	Olof Heden, Martin Hessler	On the classification of perfect codes: side class structures.	Des. Codes Cryptogr.	2006	DBLP DOI BibTeX RDF	AMS Classification 94B25
52	Yasuko Matsui, Ryuhei Uehara, Takeaki Uno	Enumeration of Perfect Sequences of Chordal Graph.	ISAAC	2008	DBLP DOI BibTeX RDF	clique tree, perfect sequence, enumeration, Chordal graph
52	Xiangyong Zeng, Lei Hu, Qingchong Liu	A Novel Method for Constructing Almost Perfect Polyphase Sequences.	WCC	2005	DBLP DOI BibTeX RDF	Periodic autocorrelation, almost perfect sequence, quadriphase sequence, binary sequence
52	Sherman S. M. Chow, Willy Susilo	Generic Construction of (Identity-Based) Perfect Concurrent Signatures.	ICICS	2005	DBLP DOI BibTeX RDF	Perfect Ambiguity, Bilinear Pairing, Fair-Exchange, Ring Signatures, Identity-based Signatures, Concurrent Signatures
52	Eran Halperin, Richard M. Karp	Perfect phylogeny and haplotype assignment.	RECOMB	2004	DBLP DOI BibTeX RDF	entropy, haplotypes, phasing, perfect phylogeny
48	Evgeny I. Krengel	Almost-Perfect and Odd-Perfect Ternary Sequences.	SETA	2004	DBLP DOI BibTeX RDF
47	Peter Scholz	Partitioning of perfect synchroneous reactive specifications to distributed processors using µ-charts.	Softw. Syst. Model.	2006	DBLP DOI BibTeX RDF	?-charts, Perfect synchrony, Fixed point semantics, Distributed systems, Partitioning, Statecharts, Reactive systems
45	Ravi Vijaya Satya, Amar Mukherjee	The Undirected Incomplete Perfect Phylogeny Problem.	IEEE ACM Trans. Comput. Biol. Bioinform.	2008	DBLP DOI BibTeX RDF	Incomplete Perfect Phylogeny, Phylogenetics, Haplotype Inference, Perfect Phylogeny
45	Kumar Chellapilla, Anton Mityagin, Denis Xavier Charles	GigaHash: scalable minimal perfect hashing for billions of urls.	WWW	2007	DBLP DOI BibTeX RDF	minimal perfect hashing, space efficient hash table, web search engine, perfect hash function
45	Mark Huber	Exact Sampling from Perfect Matchings of Dense Regular Bipartite Graphs.	Algorithmica	2006	DBLP DOI BibTeX RDF	Perfect sampling, Bregman's theorem, Minc's conjecture, Approximation algorithms, Perfect matchings, Permanent
45	Criel Merino, Gelasio Salazar, Jorge Urrutia	On the Intersection Number of Matchings and Minimum Weight Perfect Matchings of Multicolored Point Sets.	Graphs Comb.	2005	DBLP DOI BibTeX RDF	Minimum weight perfect matchings, Perfect matchings, Geometric graphs
44	Susan G. Barwick, Wen-Ai Jackson	A sequence approach to linear perfect hash families.	Des. Codes Cryptogr.	2007	DBLP DOI BibTeX RDF	AMS Classification 11T71
44	Jens Gramm, Till Nierhoff, Till Tantau	Perfect Path Phylogeny Haplotyping with Missing Data Is Fixed-Parameter Tractable.	IWPEC	2004	DBLP DOI BibTeX RDF
44	James L. Massey, Ueli M. Maurer, Muzhong Wang	Non-Expanding, Key-Minimal, Robustly-Perfect, Linear and Bilinear Ciphers.	EUROCRYPT	1987	DBLP DOI BibTeX RDF
42	Nam Yul Yu, Guang Gong	The Perfect Binary Sequence of Period 4 for Low Periodic and Aperiodic Autocorrelations.	SSC	2007	DBLP DOI BibTeX RDF	Merit factors, Perfect sequence, Periodic and aperiodic autocorrelations, Binary sequences
42	Amjad M. Daoud	Perfect hash functions for large dictionaries.	CIMS	2007	DBLP DOI BibTeX RDF	indexing, random graphs, MOS, perfect hashing, acyclic
42	Fabiano C. Botelho, Nivio Ziviani	External perfect hashing for very large key sets.	CIKM	2007	DBLP DOI BibTeX RDF	key sets, large, functions, hash, minimal, perfect
42	Noga Alon, Shai Gutner	Balanced Families of Perfect Hash Functions and Their Applications.	ICALP	2007	DBLP DOI BibTeX RDF	approximate counting of subgraphs, perfect hashing, color-coding
42	Christof Fetzer	Perfect Failure Detection in Timed Asynchronous Systems.	IEEE Trans. Computers	2003	DBLP DOI BibTeX RDF	Perfect failure detection, timed asynchronous system model, asynchronous distributed systems, crash failures
42	Takeaki Uno	A Fast Algorithm for Enumerating Bipartite Perfect Matchings.	ISAAC	2001	DBLP DOI BibTeX RDF	enumeration, perfect matching, enumerating algorithm
42	Martin Dietzfelbinger, Torben Hagerup	Simple Minimal Perfect Hashing in Less Space.	ESA	2001	DBLP DOI BibTeX RDF	minimal perfect hash functions, space requirements, Data structures, randomized algorithms, hashing, dictionaries, hash tables
41	Roland Ducournau	Perfect hashing as an almost perfect subtype test.	ACM Trans. Program. Lang. Syst.	2008	DBLP DOI BibTeX RDF	downcast, method tables, multiple subtyping, single inheritance, subtype test, virtual function tables, Java, C++, interfaces, coloring, multiple inheritance, perfect hashing, Casting, dynamic loading
40	Marina Blanton, Mikhail J. Atallah	Provable bounds for portable and flexible privacy-preserving access.	SACMAT	2005	DBLP DOI BibTeX RDF	compact policy representation, minimal perfect hash functions, order-preserving minimal perfect hash functions, portable access rights, algorithm analysis
40	László Csirmaz	The Size of a Share Must Be Large.	J. Cryptol.	1997	DBLP DOI BibTeX RDF	Polymatroid structures, Polymatroid structures, Secret sharing, Secret sharing, Key words, Ideal secret sharing schemes, Ideal secret sharing schemes, Perfect security, Perfect security
39	James A. Davis, Laurent Poinsot	G-Perfect nonlinear functions.	Des. Codes Cryptogr.	2008	DBLP DOI BibTeX RDF	11T71, AMS Classifications 05B10
39	Manindra Agrawal, Thanh Minh Hoang, Thomas Thierauf	The Polynomially Bounded Perfect Matching Problem Is in NC 2.	STACS	2007	DBLP DOI BibTeX RDF
39	Guy E. Blelloch, Kedar Dhamdhere, Eran Halperin, R. Ravi 0001, Russell Schwartz, Srinath Sridhar 0001	Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction.	ICALP (1)	2006	DBLP DOI BibTeX RDF
39	Santashil PalChaudhuri, Jean-Yves Le Boudec, Milan Vojnovic	Perfect Simulations for Random Trip Mobility Models.	Annual Simulation Symposium	2005	DBLP DOI BibTeX RDF
38	Perfect Y. Gidisu, Michiel E. Hochstenbach	A Restricted SVD Type CUR Decomposition for Matrix Triplets.	SIAM J. Sci. Comput.	2024	DBLP DOI BibTeX RDF
38	Kevin R. Quinlan, Jagadeesh Movva, Brad Perfect	Non-uniform active learning for Gaussian process models with applications to trajectory informed aerodynamic databases.	Stat. Anal. Data Min.	2024	DBLP DOI BibTeX RDF
38	Perfect Y. Gidisu, Michiel E. Hochstenbach	A DEIM-CUR factorization with iterative SVDs.	CoRR	2023	DBLP DOI BibTeX RDF
38	Perfect Y. Gidisu, Michiel E. Hochstenbach	A Generalized CUR Decomposition for Matrix Pairs.	SIAM J. Math. Data Sci.	2022	DBLP DOI BibTeX RDF
38	Perfect Y. Gidisu, Michiel E. Hochstenbach	Block Discrete Empirical Interpolation Methods.	CoRR	2022	DBLP DOI BibTeX RDF
38	Perfect Y. Gidisu, Michiel E. Hochstenbach	RSVD-CUR Decomposition for Matrix Triplets.	CoRR	2022	DBLP DOI BibTeX RDF
38	Perfect Y. Gidisu, Michiel E. Hochstenbach	A hybrid DEIM and leverage scores based method for CUR index selection.	CoRR	2022	DBLP BibTeX RDF
38	Perfect Y. Gidisu, Michiel E. Hochstenbach	A Generalized CUR decomposition for matrix pairs.	CoRR	2021	DBLP BibTeX RDF
38	Segun Aina, Samuel Dayo Okegbile, Perfect Makanju, Adeniran Ishola Oluwaranti	An Architectural Framework for Facebook Messenger Chatbot Enabled Home Appliance Control System.	Int. J. Ambient Comput. Intell.	2019	DBLP DOI BibTeX RDF
38	Janet Roveda, Michelle Perfect, Stuart F. Quan	Modeling and simulation for pediatric sleep and education performance correlations.	SpringSim (MSM)	2016	DBLP BibTeX RDF
38	Hazel Perfect	Footnote to a paper of Griggs, Yeh and Grinstead on partitioning into 4-chains.	Discret. Math.	1991	DBLP DOI BibTeX RDF
38	Victor Bryant, Hazel Perfect	Some characterization theorems for circuit spaces associated with graphs.	Discret. Math.	1977	DBLP DOI BibTeX RDF
38	Albrecht Beutelspacher	Perfect and Essentially Perfect Authentication Schemes.	EUROCRYPT	1987	DBLP DOI BibTeX RDF
37	Stephan Dominique Andres	Strong and weak Perfect Digraph Theorems for perfect, α-perfect and strictly perfect digraphs.	Discuss. Math. Graph Theory	2023	DBLP DOI BibTeX RDF
37	Selda Küçükçifçi, Charles C. Lindner	Minimum Covering for Hexagon Triple Systems.	Des. Codes Cryptogr.	2004	DBLP DOI BibTeX RDF	hexagon triple system, minimum covering, perfect
37	Junfeng Hu, Hailin Zhang	Efficient Decoder for Perfect Space-Time Codes.	CNSR	2008	DBLP DOI BibTeX RDF	Maximum likelihood (ML) decoding, multi-input multi-output (MIMO) system, perfect space-time codes
37	Michael Elberfeld, Till Tantau	Computational Complexity of Perfect-Phylogeny-Related Haplotyping Problems.	MFCS	2008	DBLP DOI BibTeX RDF	circuit classes, computational complexity, bioinformatics, haplotyping, perfect phylogenies
37	Carles Noguera, Francesc Esteva, Joan Gispert	Perfect and bipartite IMTL-algebras and disconnected rotations of prelinear semihoops.	Arch. Math. Log.	2005	DBLP DOI BibTeX RDF	Bipartite algebras, Cancellative hoops, disconnected rotation, IMTL-algebras, local algebras, perfect algebras, prelinear semihoops, Wajsberg hoops, filters, many-valued logic, MV-algebras, Algebraizable logics
37	Zhenhong Liu, Jianzhong Zhang 0001	On Inverse Problems of Optimum Perfect Matching.	J. Comb. Optim.	2003	DBLP DOI BibTeX RDF	maximum-mean alternating cycle, ellipsoid method, linear programming, perfect matching, strongly polynomial algorithm, maximum-weight matching
37	Yuzhi Cai, Wilfrid S. Kendall	Perfect simulation for correlated Poisson random variables conditioned to be positive.	Stat. Comput.	2002	DBLP DOI BibTeX RDF	dominated CFTP, extended state-space CFTP, correlated Poisson random variables conditioned to be positive, conditional Boolean model, Markov chain Monte Carlo, perfect simulation
37	Milind Dawande	A Notion of Cross-Perfect Bipartite Graphs.	COCOON	2001	DBLP DOI BibTeX RDF	integral polytope, bipartite graph, perfect graph
36	Jacky Estublier, Samir Dami	About reuse in multi-paradigm process modelling approach.	ISPW	1996	DBLP DOI BibTeX RDF	multiparadigm process modelling approach, process model reuse, software quality improvement, PERFECT project, PERFECT Improvement Approach, product improvement, APEL tool, textual language, software reuse, process improvement, software development management, graphical language, goal-oriented measurement
35	James Allen Fill, Mark Huber	The Randomness Recycler: A New Technique for Perfect Sampling.	FOCS	2000	DBLP DOI BibTeX RDF	randomness recycler, perfect sampling, approximately random samples, output samples, target distribution, classical Markov chain approaches, RR-based algorithm, perfect sampling methods, restricted instances, first expected linear time algorithms, sample generation, self-organizing lists, random independent sets, random colorings, random cluster model, RR protocol, graph theory, probability, Markov chains, probability distributions, random processes, mixing time, sampling methods, Ising model, self-adjusting systems
35	Marshall D. Brain, Alan L. Tharp	Using Tries to Eliminate Pattern Collisions in Perfect Hashing.	IEEE Trans. Knowl. Data Eng.	1994	DBLP DOI BibTeX RDF	sparse matrix packing algorithm, retrieval function complexity, perfect hashing algorithms, array-based tries, Unix word list, large word lists, function building efficiency, pattern collision avoidance, ordered minimal perfect hashing function, item lists, sparse array packing, computational complexity, Unix, file organisation, ordering, list processing
35	Edward A. Fox, Qi Fan Chen, Amjad M. Daoud, Lenwood S. Heath	Order-Preserving Minimal Perfect Hash Functions and Information Retrieval.	ACM Trans. Inf. Syst.	1991	DBLP DOI BibTeX RDF	Dictionary structure, inverted file structures, minimal perfect hashing, indexing, random graph, perfect hashing
34	Gyula Pap	Weighted restricted 2-matching.	Math. Program.	2009	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 05C70, 90C27
34	Raghav Kulkarni, Meena Mahajan	Seeking a Vertex of the Planar Matching Polytope in NC.	ESA	2004	DBLP DOI BibTeX RDF
34	Marek Karpinski, Andrzej Rucinski 0001, Edyta Szymanska	The Complexity of Perfect Matching Problems on Dense Hypergraphs.	ISAAC	2009	DBLP DOI BibTeX RDF
34	Fumei Lam, Dan Gusfield, Srinath Sridhar 0001	Generalizing the Four Gamete Condition and Splits Equivalence Theorem: Perfect Phylogeny on Three State Characters.	WABI	2009	DBLP DOI BibTeX RDF
34	Xiyong Zhang, Hua Guo	On perfect nonlinear functions (Pi).	Appl. Algebra Eng. Commun. Comput.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 05B10
34	Sosina Martirosyan, Tran van Trung	Explicit constructions for perfect hash families.	Des. Codes Cryptogr.	2008	DBLP DOI BibTeX RDF	AMS Classification 05B05
34	Joshua Letchford, Vincent Conitzer, Kamal Jain	An "Ethical" Game-Theoretic Solution Concept for Two-Player Perfect-Information Games.	WINE	2008	DBLP DOI BibTeX RDF
34	Srinath Sridhar 0001, Kedar Dhamdhere, Guy E. Blelloch, Eran Halperin, R. Ravi 0001, Russell Schwartz	Algorithms for Efficient Near-Perfect Phylogenetic Tree Reconstruction in Theory and Practice.	IEEE ACM Trans. Comput. Biol. Bioinform.	2007	DBLP DOI BibTeX RDF	trees, biology and genetics, computations on discrete structures
34	Graeme Supeene, Charles Robert Koch, Subir Bhattacharjee	Numerically Modeled Dynamic Response of Perfect and Leaky Dielectric Droplets in an Electric Field.	ICMENS	2005	DBLP DOI BibTeX RDF
34	Doreen Hertel	Cross-Correlation Properties of Perfect Binary Sequences.	SETA	2004	DBLP DOI BibTeX RDF
34	Hirotada Kobayashi	Non-interactive Quantum Perfect and Statistical Zero-Knowledge.	ISAAC	2003	DBLP DOI BibTeX RDF
34	Phillip G. Bradford, Olga V. Gavrylyako, Randy K. Smith	Perfect Secrecy in Wireless Networks.	ICPP Workshops	2003	DBLP DOI BibTeX RDF
34	Kishan Chand Gupta, Palash Sarkar 0001	Construction of Perfect Nonlinear and Maximally Nonlinear Multi-output Boolean Functions Satisfying Higher Order Strict Avalanche Criteria (Extended Abstract).	INDOCRYPT	2003	DBLP DOI BibTeX RDF	bilinear form, symplectic matrix, nonlinearity, S-box, bent function, symmetric ciphers, SAC
34	Annegret Wagler	Critical and Anticritical Edges in Perfect Graphs.	WG	2001	DBLP DOI BibTeX RDF
34	Andreas Brandstädt, Van Bang Le	Split-Perfect Graphs: Characterizations and Algorithmic Use.	WG	2000	DBLP DOI BibTeX RDF
34	Alexander Vardy, Tuvi Etzion	Some Constructions of Perfect Binary Codes.	AAECC	1993	DBLP DOI BibTeX RDF
34	Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano	Secret Sharing and Perfect Zero Knowledge.	CRYPTO	1993	DBLP DOI BibTeX RDF
34	Judy Goldsmith, Lane A. Hemachandra, Kenneth Kunen	On the Structure and Complexity of Infinite Sets with Minimal Perfect Hash Functions.	FSTTCS	1991	DBLP DOI BibTeX RDF
32	Shengbao Wang, Zhenfu Cao, ZhaoHui Cheng, Kim-Kwang Raymond Choo	Perfect forward secure identity-based authenticated key agreement protocol in the escrow mode.	Sci. China Ser. F Inf. Sci.	2009	DBLP DOI BibTeX RDF	modular security proof, provable security, bilinear pairing, authenticated key agreement, perfect forward secrecy
32	Chao Li, Qiang Li, San Ling	On the constructions of constant-composition codes from perfect nonlinear functions.	Sci. China Ser. F Inf. Sci.	2009	DBLP DOI BibTeX RDF	constant-composition codes, perfect nonlinear functions, quadratic forms
32	Tamar Barzuza, Jacques S. Beckmann, Ron Shamir, Itsik Pe'er	Computational Problems in Perfect Phylogeny Haplotyping: Typing without Calling the Allele.	IEEE ACM Trans. Comput. Biol. Bioinform.	2008	DBLP DOI BibTeX RDF	XOR-genotypes, Graph Realization, Haplotypes, Perfect Phylogeny
32	Andreas Björklund, Thore Husfeldt	Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings.	Algorithmica	2008	DBLP DOI BibTeX RDF	Exact satisfability, Number of perfect matchings, Set cover, Exact algorithms, Set partition
32	Nuray At, Stephen D. Cohen	A New Tool for Assurance of Perfect Nonlinearity.	SETA	2008	DBLP DOI BibTeX RDF	perfect nonlinear, equivalence of functions
32	Mark Giesbrecht, Daniel S. Roche	On lacunary polynomial perfect powers.	ISSAC	2008	DBLP DOI BibTeX RDF	black box polynomial, lacunary polynomial, perfect power, sparse polynomial
32	Kevin T. Phelps, Josep Rifà, Mercè Villanueva	Kernels and p-Kernels of pr-ary 1-Perfect Codes.	Des. Codes Cryptogr.	2005	DBLP DOI BibTeX RDF	q-ary codes, nonlinear codes, rank, kernel, perfect codes
32	Michael E. Houle, Ferran Hurtado, Marc Noy, Eduardo Rivera-Campo	Graphs of Triangulations and Perfect Matchings.	Graphs Comb.	2005	DBLP DOI BibTeX RDF	Non-crossing, Triangulation, Perfect matching
32	Xueliang Li 0001, Wenan Zang	A Combinatorial Algorithm for Minimum Weighted Colorings of Claw-Free Perfect Graphs.	J. Comb. Optim.	2005	DBLP DOI BibTeX RDF	algorithm, complexity, graph coloring, network flow, perfect graph
32	Bader F. AlBdaiwi, Marilynn L. Livingston	Perfect Distance-d Placements in 2D Toroidal Networks.	J. Supercomput.	2004	DBLP DOI BibTeX RDF	toroidal networks, perfect placements, distance-d placements, regular and irregular placements, resource placements
32	Peter Che Bor Lam, Heping Zhang	A Distributive Lattice on the Set of Perfect Matchings of a Plane Bipartite Graph.	Order	2003	DBLP DOI BibTeX RDF	Z-transformation graph, plane bipartite graph, poset, perfect matching, distributive lattice
32	Gérard Cornuéjols, Xinming Liu, Kristina Vuskovic	A Polynomial Algorithm for Recognizing Perfect Graphs.	FOCS	2003	DBLP DOI BibTeX RDF	odd hole, decomposition, recognition algorithm, perfect graph, cleaning
32	Torben Hagerup, Torsten Tholey	Efficient Minimal Perfect Hashing in Nearly Minimal Space.	STACS	2001	DBLP DOI BibTeX RDF	sparse tables, space complexity, algorithms and data structures, perfect hashing, Computational and structural complexity
29	Krishnendu Chatterjee, Thomas A. Henzinger	Semiperfect-Information Games.	FSTTCS	2005	DBLP DOI BibTeX RDF
29	G. Fang, Henk C. A. van Tilborg, Feng-Wen Sun, Iiro S. Honkala	Some Features of Binary Block Codes for Correcting Asymmetric Errors.	AAECC	1993	DBLP DOI BibTeX RDF
29	Vasken Bohossian, Jehoshua Bruck	Shortening Array Codes and the Perfect 1-Factorization Conjecture.	IEEE Trans. Inf. Theory	2009	DBLP DOI BibTeX RDF
29	Andrzej K. Brodzik, Richard Tolimieri	Bat Chirps With Good Properties: Zak Space Construction of Perfect Polyphase Sequences.	IEEE Trans. Inf. Theory	2009	DBLP DOI BibTeX RDF
29	Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Sebastiano Vigna	Monotone minimal perfect hashing: searching a sorted table with O(1) accesses.	SODA	2009	DBLP DOI BibTeX RDF
29	Ashish Goel, Michael Kapralov, Sanjeev Khanna	Perfect matchings via uniform sampling in regular bipartite graphs.	SODA	2009	DBLP DOI BibTeX RDF
29	Sergey V. Avgustinovich, Ivan Yu. Mogilnykh	Perfect 2-Colorings of Johnson Graphs J(6, 3) and J(7, 3).	ICMCTA	2008	DBLP DOI BibTeX RDF
29	Petros G. Voulgaris, Christoforos N. Hadjicostis, Rouzbeh Touri	A Robust Control Approach to Perfect Reconstruction of Digital Signals.	IEEE Trans. Signal Process.	2007	DBLP DOI BibTeX RDF
29	Jean Cousty, Michel Couprie, Laurent Najman, Gilles Bertrand 0001	Grayscale Watersheds on Perfect Fusion Graphs.	IWCIA	2006	DBLP DOI BibTeX RDF
29	Ching-Nung Yang, Chung-Chun Wang, Tse-Shih Chen	Real Perfect Contrast Visual Secret Sharing Schemes with Reversing.	ACNS	2006	DBLP DOI BibTeX RDF	Visual secret sharing scheme, ideal contrast, secret sharing scheme
29	Ashwin Machanavajjhala, Johannes Gehrke	On the efficiency of checking perfect privacy.	PODS	2006	DBLP DOI BibTeX RDF