Search results for "insertions"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
62	Witold Litwin, Nick Roussopoulos, Gérald Lévy, Wang Hong	Trie Hashing With Controlled Load.	IEEE Trans. Software Eng.	1991	DBLP DOI BibTeX RDF	primary key access method, dynamic files, key search, trie hashing, controlled load, THCL, TH file, B-tree file, high load factor, ordered insertions, random insertions, trees (mathematics), file organisation, information retrieval systems, load factor, load factor, disk access
55	Mark Marron, Krister M. Swenson, Bernard M. E. Moret	Genomic Distances under Deletions and Insertions.	COCOON	2003	DBLP DOI BibTeX RDF	inversion distance, reversal distance, genomic distance, Hannenhalli-Pevzner
49	Victor Khomenko	Behaviour-Preserving Transition Insertions in Unfolding Prefixes.	ICATPN	2007	DBLP DOI BibTeX RDF	Petri net unfoldings, transition insertions, encoding conflicts, Petri nets, transformations, asynchronous circuits, STGs
49	Yasuhiro Hirano, Fumiaki Miura, Tetsuji Satoh	Extendible Hashing for Concurrent Insertions and Retrievals.	PDP	1996	DBLP DOI BibTeX RDF	bucket multi-versioning, concurrent insertions, concurrent retrievals, global depth, directory entries, asynchronous modification, lock conflicts, read-only access, split bucket, simulation, concurrency control, multiprocessing systems, configuration management, speedup, file organisation, extendible hashing, processor number
46	Jian Zhang 0074, Wei Wei, Spiros Manolidis, J. Thomas Roland, Nabil Simaan	Path Planning and Workspace Determination for Robot-Assisted Insertion of Steerable Electrode Arrays for Cochlear Implant Surgery.	MICCAI (2)	2008	DBLP DOI BibTeX RDF
44	Giuseppe Di Battista, Roberto Tamassia	Incremental Planarity Testing (Extended Abstract)	FOCS	1989	DBLP DOI BibTeX RDF	edge insertions, incremental planarity testing, supports tests, vertex insertions, queries, planar graph, edges, vertices, insertion
40	Abdoulaye Baniré Diallo, Vladimir Makarenkov, Mathieu Blanchette	Finding Maximum Likelihood Indel Scenarios.	Comparative Genomics	2006	DBLP DOI BibTeX RDF	Ancestral genome reconstruction, Insertions and deletions, Tree-HMM, Ancestral mammalian genomes
40	Joaquim Gabarró, Xavier Messeguer, Daniel Riu	Concurrent Rebalancing on HyperRed-Black Trees.	SCCC	1997	DBLP DOI BibTeX RDF	concurrent rebalancing, HyperRed-Black trees, consecutive red nodes, Chromatic trees, red nodes, concurrent deletions algorithm, concurrent insertions, direct updating, red cluster, trees (mathematics), deletions
37	Jing Cai, Chung Keung Poon	OrdPathX: Supporting Two Dimensions of Node Insertion in XML Data.	DEXA	2009	DBLP DOI BibTeX RDF
37	Pankaj K. Agarwal, Haim Kaplan, Micha Sharir	Kinetic and dynamic data structures for closest pair and all nearest neighbors.	ACM Trans. Algorithms	2008	DBLP DOI BibTeX RDF	computational geometry, nearest neighbors, Kinetic data structures, closest pair
37	Jun Hu, Tolga M. Duman, Mehmet Fatih Erden	On the Information Rates of Channels with Insertion/Deletion/Substitution Errors.	ICC	2008	DBLP DOI BibTeX RDF
37	Michael A. Bender, Haodong Hu	An adaptive packed-memory array.	ACM Trans. Database Syst.	2007	DBLP DOI BibTeX RDF	Adaptive packed-memory array, locality preserving, packed-memory array, rebalance, sequential file maintenance, sequential scan, sparse array, range query, cache oblivious
37	Michael A. Bender, Martin Farach-Colton, Jeremy T. Fineman, Yonatan R. Fogel, Bradley C. Kuszmaul, Jelani Nelson	Cache-oblivious streaming B-trees.	SPAA	2007	DBLP DOI BibTeX RDF	buffered repository tree, cache-oblivious B-tree, cascading array, deamortized, lookahead array, shuttle tree
37	Michael A. Bender, Haodong Hu	An adaptive packed-memory array.	PODS	2006	DBLP DOI BibTeX RDF	adaptive packed-memory array, locality preserving, packed-memory array, rebalance, sequential file maintenance, sequential scan, sparse array, range query, cache oblivious
37	Samer Nassar, Jörg Sander 0001, Corrine Cheng	Incremental and Effective Data Summarization for Dynamic Hierarchical Clustering. (PDF / PS)	SIGMOD Conference	2004	DBLP DOI BibTeX RDF	incremental data bubbles, clustering, data summarization
37	Eljas Soisalon-Soininen, Peter Widmayer	Single and Bulk Updates in Stratified Trees: An Amortized and Worst-Case Analysis.	Computer Science in Perspective	2003	DBLP DOI BibTeX RDF
37	Monika Rauch Henzinger	Approximating Minimum Cuts under Insertions.	ICALP	1995	DBLP DOI BibTeX RDF
37	Wesley Delage	Caractérisation et détection d'insertions constitutionnelles de grande taille dans le cadre d'un usage médical. (Characterization and detection of large constitutional insertions for medical use).		2020	RDF
37	Haiyan Jiang, Christian Blouin	Insertions and the emergence of novel protein structure: a structure-based phylogenetic study of insertions.	BMC Bioinform.	2007	DBLP DOI BibTeX RDF
31	Raheleh Salari, Alexander Schönhuth, Fereydoun Hormozdiari, Artem Cherkasov, Süleyman Cenk Sahinalp	The Relation between Indel Length and Functional Divergence: A Formal Study.	WABI	2008	DBLP DOI BibTeX RDF	Alignment statistics, Pair Hidden Markov Models, Insertions, Deletions, GO
31	M. Ramalingam, K. Ramasami, Ponnambalam Venuvanalingam, J. Swaminathan	Ab Initio and DFT Investigations of the Mechanistic Pathway of Singlet Bromocarbenes Insertion into C-H Bonds of Methane and Ethane.	International Conference on Computational Science (2)	2007	DBLP DOI BibTeX RDF	bromocarbenes, ab initio, DFT, insertions, IRC
31	Luc Bougé, Joaquim Gabarró, Xavier Messeguer, Nicolas Schabanel	Concurrent Rebalancing of ACL Trees: A Fine-Grained Approach (Extended Abstract).	Euro-Par	1997	DBLP DOI BibTeX RDF	Concurrent insertions and deletions, Concurrent generalized rotations, Safety and liveness proofs, Search trees, AVL trees, Concurrent algorithms
31	Hendrik Decker	Abduction for Knowledge Assimilation in Deductive Databases.	SCCC	1997	DBLP DOI BibTeX RDF	integrity maintenance, knowledge assimilation, SLDAI, SLD-based proof procedure, update request, hypothetical fact insertions, hypothetical fact deletions, base predicates, abductive logic programming, deductive databases, deductive databases, abduction
31	Paolo Ferragina	An EREW PRAM fully-dynamic algorithm for MST.	IPPS	1995	DBLP DOI BibTeX RDF	EREW PRAM fully-dynamic algorithm, undirected weighted graph, single edge insertions, single edge deletions, sparsification data structure, parallel algorithms, parallel algorithm, computational complexity, time, trees (mathematics), minimum spanning tree, tree data structures, nodes, work
31	Elena Barcucci, Renzo Pinzani, Renzo Sprugnoli	Optimal Selection of Secondary Indexes.	IEEE Trans. Software Eng.	1990	DBLP DOI BibTeX RDF	optimal selection, secondary indexes, cost function properties, database, indexing, database management systems, queries, transaction processing, heuristic algorithm, updates, polynomial time, heuristic programming, insertions, deletions, transaction model
28	Evgeny Kharlamov, Werner Nutt, Pierre Senellart	Updating probabilistic XML.	EDBT/ICDT Workshops	2010	DBLP DOI BibTeX RDF	XML, complexity, updates, probabilistic databases
28	Thomas P. Hayes, Jared Saia, Amitabh Trehan	The forgiving graph: a distributed data structure for low stretch under adversarial attack.	PODC	2009	DBLP DOI BibTeX RDF	half-full tree, peer-to-peer, network, data structure, distributed, reconfigurable, self-healing, responsive, stretch, degree
28	Danny Z. Chen, Ewa Misiolek	Free-Form Surface Partition in 3-D.	ISAAC	2008	DBLP DOI BibTeX RDF
28	Ruijie Guo, Xueqi Cheng, Hongbo Xu, Bin Wang 0004	Efficient on-line index maintenance for dynamic text collections by using dynamic balancing tree.	CIKM	2007	DBLP DOI BibTeX RDF	dynamic text collections, index maintenance, on-line index, information retrieval, garbage collection
28	Tsvi Kopelowitz, Moshe Lewenstein	Dynamic weighted ancestors.	SODA	2007	DBLP BibTeX RDF
28	Slobodan Petrovic, Amparo Fúster-Sabater	Reconstruction of Suboptimal Paths in the Constrained Edit Distance Array with Application in Cryptanalysis.	ICCSA (3)	2007	DBLP DOI BibTeX RDF	Constrained Edit distance, Dynamic Programming, Cryptanalysis, Directed Search, String Editing
28	Guozhu Dong, Jianwen Su	Incremental Maintenance of Recursive Views Using Relational Calculus/SQL.	SIGMOD Rec.	2000	DBLP DOI BibTeX RDF	SQL
28	Daniele Frigioni, Tobias Miller, Umberto Nanni, Giulio Pasqualone, Guido Schäfer, Christos D. Zaroliagis	An Experimental Study of Dynamic Algorithms for Directed Graphs.	ESA	1998	DBLP DOI BibTeX RDF
28	Fabrizio d'Amore, Fabio Iacobini	On-Line Algorithms for Networks of Temporal Constraints.	WG	1997	DBLP DOI BibTeX RDF
28	Johannes A. La Poutré	Maintenance of Triconnected Components of Graphs (Extended Abstract).	ICALP	1992	DBLP DOI BibTeX RDF
28	Kurt Mehlhorn	A New Data Structure for Representing Sorted Lists.	WG	1980	DBLP DOI BibTeX RDF
28	Tetsuo Shibuya, Jesper Jansson 0001, Kunihiko Sadakane	Linear-Time Protein 3-D Structure Searching with Insertions and Deletions.	WABI	2009	DBLP DOI BibTeX RDF
28	M. Ramalingam, K. Ramasami, Ponnambalam Venuvanalingam, V. Sethuraman	C-H Functionalisation Through Singlet Chlorocarbenes Insertions - MP2 and DFT Investigations.	International Conference on Computational Science (3)	2006	DBLP DOI BibTeX RDF
28	Oleg Golubitsky, Sean M. Falconer	Infinite Strings Generated by Insertions.	Program. Comput. Softw.	2004	DBLP DOI BibTeX RDF
28	Han-Wen Nienhuys, A. Frank van der Stappen	A Computational Technique for Interactive Needle Insertions in 3D Nonlinear Material.	ICRA	2004	DBLP DOI BibTeX RDF
28	Nadia El-Mabrouk	Genome Rearrangement by Reversals and Insertions/Deletions of Contiguous Segments.	CPM	2000	DBLP DOI BibTeX RDF
28	Chaoyi Pang, Kotagiri Ramamohanarao, Guozhu Dong	Incremental FO(+, <) Maintenance of All-Pairs Shortest Paths for Undirected Graphs after Insertions and Deletions.	ICDT	1999	DBLP DOI BibTeX RDF
28	Mark Daley, Lila Kari, Greg Gloor, Rani Siromoney	Circular Contextual Insertions/Deletions with Applications to Biomolecular Computation.	SPIRE/CRIWG	1999	DBLP DOI BibTeX RDF
22	Nicolas Gama, Phong Q. Nguyen	Predicting Lattice Reduction.	EUROCRYPT	2008	DBLP DOI BibTeX RDF	BKZ, DEEP Insertions, Lattice-based cryptosystems, Lattice Reduction, LLL
22	Michael A. Bender, Erik D. Demaine, Martin Farach-Colton	Cache-Oblivious B-Trees.	FOCS	2000	DBLP DOI BibTeX RDF	cache-oblivious B-trees, dynamic search-tree data structures, optimal search bound, amortized memory transfers, computational complexity, memory hierarchy, cache storage, tree data structures, insertions, deletions, tree searching, hierarchical memory, worst-case bounds
22	Sunil Arya, David M. Mount, Michiel H. M. Smid	Randomized and deterministic algorithms for geometric spanners of small diameter	FOCS	1994	DBLP DOI BibTeX RDF	randomized algorithms, directed graph, deterministic algorithms, insertions, deletions, geometric spanners
22	Keh-Chang Guh, Clement T. Yu	Efficient Management of Materialized Generalized Transitive Closure in Centralized and Parallel Environments.	IEEE Trans. Knowl. Data Eng.	1992	DBLP DOI BibTeX RDF	centralised environments, materialized generalized transitive closure, computational complexity, parallel processing, data structure, data structures, expert systems, queries, time complexities, deductive databases, insertions, deletions, parallel environments, multiprocessor environment
22	Monika Rauch	Fully Dynamic Biconnectivity in Graphs	FOCS	1992	DBLP DOI BibTeX RDF	query time, dynamic biconnectivity, edge insertions, linear storage, amortized running time, planar embedded graph, graphs, time complexity, deletions
22	Frank Thomson Leighton, Eric J. Schwabe	Efficient Algorithms for Dynamic Allocation of Distributed Memory	FOCS	1991	DBLP DOI BibTeX RDF	local memory resources, online allocation algorithm, near-optimal fashion, service delays, algorithms, parallel system, distributed memory, insertions, deletions, dynamic allocation
22	Otfried Schwarzkopf	Dynamic Maintenance of Geometric Structures Made Easy	FOCS	1991	DBLP DOI BibTeX RDF	dynamic maintenance, Voronoi diagrams, convex hulls, insertions, deletions, geometric structures, randomized incremental algorithms, planar subdivisions, backwards analysis
22	William I. Chang, Eugene L. Lawler	Approximate String Matching in Sublinear Expected Time	FOCS	1990	DBLP DOI BibTeX RDF	random string, infrequent errors, sublinear expected time, pattern string, substring matching, dynamic programming, efficient algorithms, genetics, insertions, approximate string matching, deletions, substitutions, differences, molecular biology, text string
18	Cédric du Mouza, Witold Litwin, Philippe Rigaux	Large-scale indexing of spatial data in distributed repositories: the SD-Rtree.	VLDB J.	2009	DBLP DOI BibTeX RDF	Distributed structure, Spatial indexing
18	Siddhartha Sen 0001, Robert Endre Tarjan	Deletion without Rebalancing in Multiway Search Trees.	ISAAC	2009	DBLP DOI BibTeX RDF
18	Liang Xu, Tok Wang Ling, Huayu Wu 0001, Zhifeng Bao	DDE: from dewey to a fully dynamic XML labeling scheme.	SIGMOD Conference	2009	DBLP DOI BibTeX RDF	dewey, dynamic xml, update, labeling scheme
18	Serge Abiteboul, Pierre Bourhis, Bogdan Marinoiu	Satisfiability and relevance for queries over active documents.	PODS	2009	DBLP DOI BibTeX RDF	active XML, query satisfiability, relevance
18	Kamesh Madduri, David A. Bader	Compact graph representations and parallel connectivity algorithms for massive dynamic network analysis.	IPDPS	2009	DBLP DOI BibTeX RDF
18	Huiqun Deng, George Stathopoulos, Ching Y. Suen	Error-Correcting Output Coding for the Convolutional Neural Network for Optical Character Recognition.	ICDAR	2009	DBLP DOI BibTeX RDF
18	Krister M. Swenson, Mark Marron, Joel V. Earnest-DeYoung, Bernard M. E. Moret	Approximating the true evolutionary distance between two genomes.	ACM J. Exp. Algorithmics	2008	DBLP DOI BibTeX RDF	pairwise distances, whole-genome data, Evolution, inversions, duplications
18	Gonzalo Navarro 0001, Nora Reyes	Dynamic spatial approximation trees.	ACM J. Exp. Algorithmics	2008	DBLP DOI BibTeX RDF	similarity or proximity search, spatial and multidimensional search, spatial approximation tree, Multimedia databases
18	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
18	Lars Arge, Gerth Stølting Brodal, S. Srinivasa Rao 0001	External memory planar point location with logarithmic updates.	SCG	2008	DBLP DOI BibTeX RDF	dynamic data structure, external memory, point location, planar subdivisions
18	Stephen J. Hegner	Information-Optimal Reflections of View Updates on Relational Database Schemata.	FoIKS	2008	DBLP DOI BibTeX RDF	view, update
18	Stratos Idreos, Martin L. Kersten, Stefan Manegold	Updating a cracked database.	SIGMOD Conference	2007	DBLP DOI BibTeX RDF	database cracking, self-organization, updates
18	Rainer Gemulla, Wolfgang Lehner, Peter J. Haas	Maintaining bernoulli samples over evolving multisets.	PODS	2007	DBLP DOI BibTeX RDF	Bernoulli multiset sampling, incremental sample maintenance
18	Axel Mosig, Julian J.-L. Chen, Peter F. Stadler	Homology Search with Fragmented Nucleic Acid Sequence Patterns.	WABI	2007	DBLP DOI BibTeX RDF
18	Jiakui Zhao, Dongqing Yang, Lijun Chen 0002, Jun Gao 0003, Tengjiao Wang 0003	Cardinality Computing: A New Step Towards Fully Representing Multi-sets by Bloom Filters.	WISE	2006	DBLP DOI BibTeX RDF
18	Timothy M. Chan	A dynamic data structure for 3-d convex hulls and 2-d nearest neighbor queries.	SODA	2006	DBLP DOI BibTeX RDF
18	Prasad Vinod, Suri Pushpa, Carsten Maple	Maintaining a Random Binary Search Tree Dynamically.	IV	2006	DBLP DOI BibTeX RDF
18	Hagit Attiya, Eshcar Hillel	Built-In Coloring for Highly-Concurrent Doubly-Linked Lists.	DISC	2006	DBLP DOI BibTeX RDF
18	Zhuo Feng, Peng Li 0001, Jiang Hu	Efficient Model Update for General Link-Insertion Networks.	ISQED	2006	DBLP DOI BibTeX RDF
18	Vijaya Smitha Kolli, Hui Liu 0008, Jieyue He, Michelle Hong Pan, Yi Pan 0001	Calculating Genomic Distances in Parallel Using OpenMP.	Trans. Comp. Sys. Biology	2005	DBLP DOI BibTeX RDF
18	Enrico Pontelli, Desh Ranjan	A Simple Optimal Solution for the Temporal Precedence Problem on Pure Pointer Machines.	Theory Comput. Syst.	2005	DBLP DOI BibTeX RDF
18	Bing Wu 0005, Roberta L. Klatzky, Damion Shelton, George D. Stetten	Psychophysical Evaluation of In-Situ Ultrasound Visualization.	IEEE Trans. Vis. Comput. Graph.	2005	DBLP DOI BibTeX RDF	real time, Psychology, medical information systems, evaluation/methodology, artificial, augmented and virtual realities, image display
18	Elke Achtert, Christian Böhm 0001, Hans-Peter Kriegel, Peer Kröger	Online Hierarchical Clustering in a Data Warehouse Environment.	ICDM	2005	DBLP DOI BibTeX RDF
18	Heikki Hyyrö, Yoan J. Pinzón, Ayumi Shinohara	New Bit-Parallel Indel-Distance Algorithm.	WEA	2005	DBLP DOI BibTeX RDF
18	Sergey Bereg	Certifying and constructing minimally rigid graphs in the plane.	SCG	2005	DBLP DOI BibTeX RDF	Henneberg construction, rigidity theory, computational geometry, tree decomposition, pseudo-triangulation
18	Vijaya Smitha Kolli, Hui Liu 0008, Michelle Hong Pan, Yi Pan 0001	A Parallel Implementation for Determining Genomic Distances Under Deletion and Insertion.	International Conference on Computational Science (2)	2005	DBLP DOI BibTeX RDF
18	Spyros Sioutas, Yannis Panagis, Evangelos Theodoridis, Athanasios K. Tsakalidis	One-Dimensional Finger Searching in RAM Model Revisited.	Panhellenic Conference on Informatics	2005	DBLP DOI BibTeX RDF
18	Heikki Hyyrö, Yoan J. Pinzón, Ayumi Shinohara	Fast Bit-Vector Algorithms for Approximate String Matching Under Indel Distance.	SOFSEM	2005	DBLP DOI BibTeX RDF
18	Guangming Xing, Bill Tseng	Extendible Range-Based Numbering Scheme for XML Document.	ITCC (2)	2004	DBLP DOI BibTeX RDF
18	Torsten Tholey	A Dynamic Data Structure for Maintaining Disjoint Paths Information in Digraphs.	ISAAC	2003	DBLP DOI BibTeX RDF
18	Gerth Stølting Brodal, Rolf Fagerberg	Lower bounds for external memory dictionaries.	SODA	2003	DBLP BibTeX RDF
18	Rajeev Raman, S. Srinivasa Rao 0001	Succinct Dynamic Dictionaries and Trees.	ICALP	2003	DBLP DOI BibTeX RDF
18	Saar Cohen 0002, Yossi Matias	Spectral Bloom Filters.	SIGMOD Conference	2003	DBLP DOI BibTeX RDF
18	Taehyun Kim 0003, Jack Brassil	Dynamic program insertion in high quality video over IP.	NOSSDAV	2003	DBLP DOI BibTeX RDF	digital television (DTV), multimedia signaling, program and system information protocol (PSIP), program cues, video streaming, real-time transport protocol (RTP), content delivery networks (CDNs)
18	Haim Kaplan, Eyal Molad, Robert Endre Tarjan	Dynamic rectangular intersection with priorities.	STOC	2003	DBLP DOI BibTeX RDF	rectangular intersection, rectangular point location, packet classification, orthogonal range searching
18	Edith Cohen, Haim Kaplan, Tova Milo	Labeling Dynamic XML Trees. (PDF / PS)	PODS	2002	DBLP DOI BibTeX RDF	XML
18	Eljas Soisalon-Soininen, Peter Widmayer	Amortized Complexity of Bulk Updates in AVL-Trees.	SWAT	2002	DBLP DOI BibTeX RDF
18	Gonzalo Navarro 0001, Nora Reyes	Dynamic Spatial Approximation Trees.	SCCC	2001	DBLP DOI BibTeX RDF	metric spaces, high dimensions, proximity searching
18	Eijiro Sumii, Naoki Kobayashi 0001	Online-and-Offline Partial Evaluation: A Mixed Approach (Extended Abstract).	PEPM	2000	DBLP DOI BibTeX RDF
18	André Brinkmann, Kay Salzwedel, Christian Scheideler	Efficient, distributed data placement strategies for storage area networks (extended abstract).	SPAA	2000	DBLP DOI BibTeX RDF
18	Arnon Amir, Alon Efrat, Piotr Indyk, Hanan Samet	Efficient Regular Data Structures and Algorithms for Location and Proximity Problems.	FOCS	1999	DBLP DOI BibTeX RDF
18	Gerth Stølting Brodal, Rolf Fagerberg	Dynamic Representation of Sparse Graphs.	WADS	1999	DBLP DOI BibTeX RDF
18	Rupesh Choubey, Li Chen 0016, Elke A. Rundensteiner	GBI: A Generalized R-Tree Bulk-Insertion Strategy.	SSD	1999	DBLP DOI BibTeX RDF
18	Amalia Duch, Vladimir Estivill-Castro, Conrado Martínez	Randomized K-Dimensional Binary Search Trees.	ISAAC	1998	DBLP DOI BibTeX RDF
18	Pankaj K. Agarwal, David Eppstein, Leonidas J. Guibas, Monika Rauch Henzinger	Parametric and Kinetic Minimum Spanning Trees.	FOCS	1998	DBLP DOI BibTeX RDF
18	Dominique Laurent 0001, Viet Phan Luong, Nicolas Spyratos	The Use of Deleted Tuples in Database, Querying and Updating.	Acta Informatica	1997	DBLP DOI BibTeX RDF
18	Serafino Cicerone, Daniele Frigioni, Umberto Nanni, Francesco Pugliese	Counting Edges in a Dag.	WG	1996	DBLP DOI BibTeX RDF
18	Sotiris E. Nikoletseas, John H. Reif, Paul G. Spirakis, Moti Yung	Stochastic Graphs Have Short Memory: Fully Dynamic Connectivity in Poly-Log Expected Time.	ICALP	1995	DBLP DOI BibTeX RDF
18	Tilmann F. W. Bruckhaus	Analyzing CASE impact.	CASCON	1995	DBLP BibTeX RDF	CASE adoption, CASE impact, TIM, TIM/Impact, quantitative process modeling, quantitative tool insertion impact analysis, software quality and productivity, case study